/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-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:24:50,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:24:50,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:24:50,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:24:50,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:24:50,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:24:50,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:24:50,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:24:50,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:24:50,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:24:50,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:24:50,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:24:50,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:24:50,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:24:50,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:24:50,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:24:50,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:24:50,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:24:50,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:24:50,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:24:50,522 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:24:50,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:24:50,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:24:50,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:24:50,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:24:50,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:24:50,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:24:50,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:24:50,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:24:50,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:24:50,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:24:50,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:24:50,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:24:50,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:24:50,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:24:50,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:24:50,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:24:50,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:24:50,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:24:50,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:24:50,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:24:50,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:24:50,549 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:24:50,577 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:24:50,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:24:50,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:24:50,578 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:24:50,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:24:50,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:24:50,580 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:24:50,580 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:24:50,580 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:24:50,581 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:24:50,581 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:24:50,581 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:24:50,581 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:24:50,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:24:50,582 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:24:50,582 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:24:50,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:24:50,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:24:50,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:24:50,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:24:50,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:24:50,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:24:50,583 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:24:50,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:24:50,584 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:24:50,584 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:24:50,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:24:50,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:24:50,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:24:50,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:24:50,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:24:50,586 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:24:50,586 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:24:50,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:24:50,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:24:50,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:24:50,975 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:24:50,978 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:24:50,981 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c [2022-07-22 12:24:51,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c0452688/a093e5cafaeb45139242107b9cbe2bc5/FLAGf20508087 [2022-07-22 12:24:51,755 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:24:51,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c [2022-07-22 12:24:51,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c0452688/a093e5cafaeb45139242107b9cbe2bc5/FLAGf20508087 [2022-07-22 12:24:52,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c0452688/a093e5cafaeb45139242107b9cbe2bc5 [2022-07-22 12:24:52,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:24:52,076 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:24:52,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:24:52,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:24:52,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:24:52,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:24:52" (1/1) ... [2022-07-22 12:24:52,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43cddad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:52, skipping insertion in model container [2022-07-22 12:24:52,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:24:52" (1/1) ... [2022-07-22 12:24:52,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:24:52,132 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:24:52,373 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-prod-cons3.wvr.c[4007,4020] [2022-07-22 12:24:52,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:24:52,390 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:24:52,424 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-prod-cons3.wvr.c[4007,4020] [2022-07-22 12:24:52,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:24:52,448 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:24:52,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:52 WrapperNode [2022-07-22 12:24:52,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:24:52,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:24:52,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:24:52,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:24:52,459 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:24:52" (1/1) ... [2022-07-22 12:24:52,471 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:24:52" (1/1) ... [2022-07-22 12:24:52,531 INFO L137 Inliner]: procedures = 26, calls = 73, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 260 [2022-07-22 12:24:52,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:24:52,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:24:52,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:24:52,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:24:52,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:52" (1/1) ... [2022-07-22 12:24:52,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:52" (1/1) ... [2022-07-22 12:24:52,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:52" (1/1) ... [2022-07-22 12:24:52,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:52" (1/1) ... [2022-07-22 12:24:52,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:52" (1/1) ... [2022-07-22 12:24:52,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:52" (1/1) ... [2022-07-22 12:24:52,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:52" (1/1) ... [2022-07-22 12:24:52,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:24:52,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:24:52,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:24:52,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:24:52,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:52" (1/1) ... [2022-07-22 12:24:52,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:52,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:52,662 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:24:52,664 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:24:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:24:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:24:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:24:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:24:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:24:52,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:24:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:24:52,719 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:24:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:24:52,719 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:24:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-07-22 12:24:52,720 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-07-22 12:24:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:24:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:24:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:24:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:24:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:24:52,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:24:52,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:24:52,723 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:24:52,836 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:24:52,838 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:24:53,460 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:24:53,632 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:24:53,633 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-22 12:24:53,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:24:53 BoogieIcfgContainer [2022-07-22 12:24:53,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:24:53,639 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:24:53,639 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:24:53,644 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:24:53,645 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:24:53,646 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:24:52" (1/3) ... [2022-07-22 12:24:53,647 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41e7fc7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:24:53, skipping insertion in model container [2022-07-22 12:24:53,647 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:24:53,648 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:52" (2/3) ... [2022-07-22 12:24:53,648 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41e7fc7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:24:53, skipping insertion in model container [2022-07-22 12:24:53,649 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:24:53,649 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:24:53" (3/3) ... [2022-07-22 12:24:53,651 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-prod-cons3.wvr.c [2022-07-22 12:24:53,771 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-22 12:24:53,826 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 226 places, 235 transitions, 502 flow [2022-07-22 12:24:53,964 INFO L129 PetriNetUnfolder]: 18/227 cut-off events. [2022-07-22 12:24:53,965 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-22 12:24:53,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 227 events. 18/227 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 120 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 194. Up to 3 conditions per place. [2022-07-22 12:24:53,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 235 transitions, 502 flow [2022-07-22 12:24:53,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 227 transitions, 478 flow [2022-07-22 12:24:53,986 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:24:54,004 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 227 transitions, 478 flow [2022-07-22 12:24:54,007 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 227 transitions, 478 flow [2022-07-22 12:24:54,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 222 places, 227 transitions, 478 flow [2022-07-22 12:24:54,055 INFO L129 PetriNetUnfolder]: 18/227 cut-off events. [2022-07-22 12:24:54,056 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-22 12:24:54,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 227 events. 18/227 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 125 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 194. Up to 3 conditions per place. [2022-07-22 12:24:54,062 INFO L116 LiptonReduction]: Number of co-enabled transitions 2284 [2022-07-22 12:25:03,355 INFO L131 LiptonReduction]: Checked pairs total: 4437 [2022-07-22 12:25:03,355 INFO L133 LiptonReduction]: Total number of compositions: 235 [2022-07-22 12:25:03,393 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:25:03,393 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:25:03,394 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:25:03,394 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:25:03,394 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:25:03,395 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:25:03,395 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:25:03,395 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:25:03,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:25:03,661 INFO L131 ngComponentsAnalysis]: Automaton has 152 accepting balls. 686 [2022-07-22 12:25:03,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:03,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:03,669 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:25:03,669 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:03,669 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:25:03,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 777 states, but on-demand construction may add more states [2022-07-22 12:25:03,688 INFO L131 ngComponentsAnalysis]: Automaton has 152 accepting balls. 686 [2022-07-22 12:25:03,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:03,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:03,689 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:25:03,689 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:03,697 INFO L748 eck$LassoCheckResult]: Stem: 229#[ULTIMATE.startENTRY]don't care [977] ULTIMATE.startENTRY-->L160-6: Formula: (let ((.cse2 (store |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 1))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85| 1))) (let ((.cse0 (select |v_#memory_int_245| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= (ite (< v_~W~0_87 1073741823) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_77| 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|) (< 0 |v_#StackHeapBarrier_64|) (= v_~queue1~0.offset_75 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|) (= v_~queue2~0.offset_85 0) (= (select |v_#valid_354| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205| 0)) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_77|) (= (store (store (store (store (store |v_#length_287| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_89| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_285|) (= |v_#NULL.offset_20| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| v_~n1~0_102) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_51| 0) (= (select |v_#length_287| 2) 24) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t3~0#1.base_85|) (= (select .cse0 0) 48) (= (select |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= v_~d1~0_58 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|) (= v_~back1~0_114 v_~front1~0_96) (= v_~queue1~0.base_75 0) (= v_~front2~0_100 v_~back2~0_134) (= |v_#NULL.base_20| 0) (= v_~v_assert~0_111 1) (= (select .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85|) 0) (= v_~queue2~0.base_85 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t4~0#1.base_89|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_51| 0) (= (select |v_#length_287| 1) 2) (= (select .cse0 1) 0) (= (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1) |v_#valid_352|) (= (select |v_#valid_354| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (= v_~d2~0_57 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_64|) (= (select |v_#valid_354| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_354|, #memory_int=|v_#memory_int_245|, #length=|v_#length_287|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~back2~0=v_~back2~0_134, #NULL.offset=|v_#NULL.offset_20|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_61|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_26|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_56|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_71|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_35|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_43|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_56|, ~queue2~0.base=v_~queue2~0.base_85, #length=|v_#length_285|, ~front1~0=v_~front1~0_96, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_89|, ~queue2~0.offset=v_~queue2~0.offset_85, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_61|, ~back1~0=v_~back1~0_114, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_69|, ~v_assert~0=v_~v_assert~0_111, #StackHeapBarrier=|v_#StackHeapBarrier_64|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_71|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_31|, ~front2~0=v_~front2~0_100, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|, ~n1~0=v_~n1~0_102, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_77|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_85|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_25|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_69|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_51|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_47|, ~W~0=v_~W~0_87, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39|, ~queue1~0.base=v_~queue1~0.base_75, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|, ~d2~0=v_~d2~0_57, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_43|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_52|, ~n2~0=v_~n2~0_100, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_59|, #NULL.base=|v_#NULL.base_20|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_54|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_49|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_67|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_41|, #valid=|v_#valid_352|, #memory_int=|v_#memory_int_245|, ~queue1~0.offset=v_~queue1~0.offset_75, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_77|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_23|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|, ~d1~0=v_~d1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_~#t2~0#1.offset, ~back2~0, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_main_#t~nondet13#1, ~queue2~0.base, #length, ~front1~0, ULTIMATE.start_main_~#t4~0#1.base, ~queue2~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ~back1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~front2~0, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~n1~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ~W~0, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~d2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~nondet10#1, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, #valid, ~queue1~0.offset, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~d1~0] 232#[L160-6]don't care [2022-07-22 12:25:03,697 INFO L750 eck$LassoCheckResult]: Loop: 232#[L160-6]don't care [921] L160-6-->L160-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1))) (and (= (select |v_#valid_224| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| |v_ULTIMATE.start_create_fresh_int_array_~size#1_67|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1 4) (select |v_#length_179| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 1)) (= (store |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|)) |v_#memory_int_177|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_178|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_37|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_177|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 232#[L160-6]don't care [2022-07-22 12:25:03,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:03,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1008, now seen corresponding path program 1 times [2022-07-22 12:25:03,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:03,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111734467] [2022-07-22 12:25:03,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:03,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:03,875 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:03,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:03,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:03,976 INFO L85 PathProgramCache]: Analyzing trace with hash 952, now seen corresponding path program 1 times [2022-07-22 12:25:03,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:03,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097448647] [2022-07-22 12:25:03,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:03,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:04,015 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:04,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:04,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:04,042 INFO L85 PathProgramCache]: Analyzing trace with hash 32169, now seen corresponding path program 1 times [2022-07-22 12:25:04,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:04,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838800084] [2022-07-22 12:25:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:04,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:04,104 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:04,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:05,052 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:05,053 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:05,053 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:05,054 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:05,054 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:05,054 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:05,054 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:05,054 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:05,055 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-prod-cons3.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:25:05,055 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:05,055 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:05,084 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:25:05,089 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:25:05,093 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:25:05,095 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:25:05,098 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:25:05,104 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:25:05,114 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:25:05,116 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:25:05,118 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:25:05,120 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:25:05,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:25:05,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:25:05,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:25:05,128 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:25:05,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:25:05,134 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:25:05,136 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:25:05,138 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:25:05,139 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:25:05,141 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:25:05,143 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:25:05,146 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:25:05,148 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:25:05,150 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:25:05,151 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:25:05,153 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:25:05,157 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:25:05,159 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:25:05,161 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:25:05,163 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:25:05,164 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:25:05,166 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:25:05,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:25:05,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:25:05,174 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:25:05,176 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:25:05,178 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:25:05,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:25:05,181 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:25:05,183 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:25:05,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:25:05,189 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:25:05,710 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:25:05,713 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:25:05,715 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:25:05,716 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:25:05,718 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:25:05,720 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:25:05,722 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:25:05,725 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:25:05,727 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:25:05,729 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:25:05,732 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:25:05,734 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:25:06,330 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:25:06,335 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:25:06,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:06,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:06,358 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:25:06,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:06,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:06,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:06,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:06,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:06,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:06,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:06,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:06,403 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:25:06,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:06,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 12:25:06,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:06,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:06,439 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:25:06,440 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:25:06,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:06,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:06,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:06,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:06,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:06,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:06,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:06,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:06,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:06,477 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:25:06,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:06,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:06,480 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:25:06,481 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:25:06,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:06,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:06,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:06,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:06,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:06,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:06,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:06,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:06,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:06,521 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:25:06,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:06,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:06,522 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:25:06,523 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:25:06,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:06,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:06,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:06,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:06,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:06,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:06,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:06,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:06,571 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:25:06,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:06,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:06,573 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:25:06,574 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:25:06,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:25:06,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:06,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:06,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:06,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:06,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:06,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:06,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:06,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:06,610 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:25:06,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:06,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:06,613 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:25:06,614 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:25:06,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:06,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:06,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:06,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:06,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:06,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:06,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:06,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:06,676 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:25:06,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:06,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:06,678 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:25:06,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:06,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:06,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:06,695 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:25:06,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:06,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:06,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:06,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:06,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:06,731 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:25:06,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:06,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:06,732 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:25:06,738 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:25:06,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:06,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:06,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:06,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:06,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:06,753 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:06,754 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:06,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:06,799 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:25:06,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:06,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:06,801 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:25:06,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:06,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:06,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:06,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:06,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:06,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:06,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:06,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:06,818 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:25:06,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:06,865 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:25:06,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:06,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:06,867 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:25:06,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:06,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:06,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:06,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:06,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:06,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:06,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:06,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:06,887 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:25:06,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:06,918 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:25:06,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:06,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:06,919 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:25:06,922 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:25:06,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:06,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:06,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:06,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:06,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:06,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:06,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:06,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:06,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:06,978 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:25:06,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:06,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:06,979 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:25:06,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:06,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:06,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:06,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:06,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:06,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:06,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:06,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:06,997 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:25:07,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:07,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,045 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:25:07,048 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:25:07,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:25:07,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:07,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:07,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,112 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:25:07,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,113 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:25:07,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:07,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:07,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:07,135 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:25:07,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,179 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:25:07,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,181 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:25:07,187 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:25:07,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:25:07,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:07,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:07,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:07,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,256 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:25:07,268 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:25:07,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:07,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:07,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:07,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:07,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,321 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:25:07,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,323 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:25:07,325 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:25:07,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:07,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:07,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:07,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:07,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,360 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:25:07,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,362 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:25:07,367 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:25:07,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:07,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:07,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:07,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:07,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,403 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:25:07,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,405 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:25:07,406 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:25:07,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:07,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:07,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:07,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:07,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,438 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:25:07,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,439 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:25:07,441 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:25:07,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:07,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:07,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:07,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:07,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,474 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:25:07,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,477 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:25:07,478 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:25:07,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:25:07,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:07,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:07,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-22 12:25:07,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,519 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:25:07,519 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:25:07,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:07,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:07,528 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:07,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,582 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:25:07,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,583 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:25:07,584 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:25:07,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:07,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:07,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:07,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:07,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,616 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:25:07,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,618 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:25:07,619 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:25:07,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:07,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:07,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:07,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-22 12:25:07,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,657 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:25:07,658 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:25:07,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:07,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:07,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:07,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,696 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:25:07,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,698 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:25:07,699 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:25:07,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:07,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:07,709 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:07,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-22 12:25:07,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,734 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:25:07,735 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:25:07,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:07,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:07,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:07,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:07,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,801 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:25:07,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:07,807 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:25:07,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:07,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:07,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:07,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,855 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:25:07,858 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:25:07,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:07,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:07,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:07,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:07,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,891 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:25:07,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,892 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:25:07,894 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:25:07,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:07,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:07,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:07,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:07,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,925 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:25:07,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,926 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:25:07,927 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:25:07,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:07,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:07,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:07,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:07,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:07,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:07,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:07,965 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:25:07,967 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:25:07,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:07,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:07,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:07,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:07,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:07,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:07,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:07,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:08,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,034 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:25:08,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,036 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:25:08,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:08,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:08,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:08,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:08,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:25:08,058 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:08,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,084 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:25:08,085 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:25:08,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:08,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:08,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:08,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-22 12:25:08,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,124 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:25:08,124 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:25:08,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:08,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:08,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:08,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:08,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,157 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:25:08,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,158 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:25:08,160 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:25:08,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:25:08,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:08,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:08,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-22 12:25:08,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,211 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:25:08,212 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:25:08,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:08,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:08,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:08,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:08,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-22 12:25:08,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,255 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:25:08,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:08,258 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:25:08,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:08,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:08,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-22 12:25:08,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,299 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:25:08,300 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:25:08,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:08,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:08,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:08,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:08,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,342 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:25:08,343 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:25:08,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:08,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:08,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:08,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:08,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,407 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:25:08,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,409 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:25:08,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:08,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:08,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:08,428 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:25:08,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,462 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:25:08,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,463 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:25:08,467 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:25:08,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:25:08,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:08,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:08,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,502 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:25:08,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,503 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:25:08,504 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:25:08,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:08,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:08,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:08,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:08,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,541 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:25:08,542 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:25:08,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:08,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:08,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:08,554 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,575 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:25:08,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,576 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:25:08,577 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:25:08,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:08,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:08,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:08,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,614 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:25:08,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,615 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:25:08,616 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:25:08,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:08,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:08,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:08,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:08,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,652 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:25:08,653 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:25:08,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:08,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:08,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:08,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:08,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,692 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:25:08,693 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:25:08,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:08,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:08,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:08,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,727 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:25:08,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,729 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:25:08,729 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:25:08,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:08,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:08,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:08,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,766 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:25:08,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,767 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:25:08,768 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:25:08,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:08,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:08,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:08,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,807 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:25:08,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,809 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:25:08,810 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:25:08,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:08,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:08,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:08,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:08,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,843 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:25:08,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,844 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:25:08,847 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:25:08,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:08,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:08,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:08,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:08,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:08,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,889 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:25:08,890 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:25:08,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:08,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:08,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:08,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:08,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,926 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:25:08,927 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:25:08,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:25:08,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:08,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:08,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:08,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:08,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:08,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:08,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:08,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:08,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:08,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:08,991 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:25:08,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:09,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:09,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:09,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:09,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:09,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:09,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:09,008 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:25:09,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:09,051 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:25:09,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:09,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:09,053 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:25:09,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:09,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:09,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:09,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:09,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:09,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:09,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:09,069 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:25:09,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:09,111 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:25:09,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:09,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:09,113 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:25:09,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:09,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:09,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:09,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:09,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:09,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:09,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:09,129 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:25:09,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:09,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-07-22 12:25:09,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:09,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:09,157 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:25:09,159 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:25:09,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:09,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:09,166 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:25:09,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:09,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:09,170 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:25:09,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:09,178 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:09,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-07-22 12:25:09,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:09,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:09,202 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:25:09,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:09,214 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:25:09,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:09,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:09,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:09,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:09,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:09,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:09,242 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:25:09,303 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-22 12:25:09,304 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-07-22 12:25:09,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:09,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:09,315 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:25:09,352 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:25:09,354 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:25:09,366 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-22 12:25:09,366 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:25:09,367 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_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 4*ULTIMATE.start_create_fresh_int_array_~i~0#1 Supporting invariants [1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset >= 0] [2022-07-22 12:25:09,415 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:25:09,564 INFO L257 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2022-07-22 12:25:09,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:09,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 12:25:09,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:09,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:25:09,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:09,661 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:25:09,698 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:25:09,701 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 777 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:25:09,794 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 777 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 780 states and 2954 transitions. Complement of second has 3 states. [2022-07-22 12:25:09,797 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:25:09,803 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:25:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:25:09,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:25:09,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:09,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:25:09,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:09,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:25:09,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:09,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 780 states and 2954 transitions. [2022-07-22 12:25:09,825 INFO L131 ngComponentsAnalysis]: Automaton has 151 accepting balls. 685 [2022-07-22 12:25:09,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 780 states to 760 states and 2898 transitions. [2022-07-22 12:25:09,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 758 [2022-07-22 12:25:09,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 759 [2022-07-22 12:25:09,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 760 states and 2898 transitions. [2022-07-22 12:25:09,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:09,867 INFO L220 hiAutomatonCegarLoop]: Abstraction has 760 states and 2898 transitions. [2022-07-22 12:25:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states and 2898 transitions. [2022-07-22 12:25:09,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 759. [2022-07-22 12:25:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 759 states have (on average 3.8155467720685112) internal successors, (2896), 758 states have internal predecessors, (2896), 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:25:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 2896 transitions. [2022-07-22 12:25:09,965 INFO L242 hiAutomatonCegarLoop]: Abstraction has 759 states and 2896 transitions. [2022-07-22 12:25:09,965 INFO L425 stractBuchiCegarLoop]: Abstraction has 759 states and 2896 transitions. [2022-07-22 12:25:09,965 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:25:09,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 759 states and 2896 transitions. [2022-07-22 12:25:09,976 INFO L131 ngComponentsAnalysis]: Automaton has 151 accepting balls. 685 [2022-07-22 12:25:09,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:09,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:09,977 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 12:25:09,977 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:09,978 INFO L748 eck$LassoCheckResult]: Stem: 4221#[ULTIMATE.startENTRY]don't care [977] ULTIMATE.startENTRY-->L160-6: Formula: (let ((.cse2 (store |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 1))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85| 1))) (let ((.cse0 (select |v_#memory_int_245| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= (ite (< v_~W~0_87 1073741823) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_77| 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|) (< 0 |v_#StackHeapBarrier_64|) (= v_~queue1~0.offset_75 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|) (= v_~queue2~0.offset_85 0) (= (select |v_#valid_354| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205| 0)) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_77|) (= (store (store (store (store (store |v_#length_287| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_89| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_285|) (= |v_#NULL.offset_20| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| v_~n1~0_102) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_51| 0) (= (select |v_#length_287| 2) 24) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t3~0#1.base_85|) (= (select .cse0 0) 48) (= (select |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= v_~d1~0_58 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|) (= v_~back1~0_114 v_~front1~0_96) (= v_~queue1~0.base_75 0) (= v_~front2~0_100 v_~back2~0_134) (= |v_#NULL.base_20| 0) (= v_~v_assert~0_111 1) (= (select .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85|) 0) (= v_~queue2~0.base_85 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t4~0#1.base_89|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_51| 0) (= (select |v_#length_287| 1) 2) (= (select .cse0 1) 0) (= (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1) |v_#valid_352|) (= (select |v_#valid_354| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (= v_~d2~0_57 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_64|) (= (select |v_#valid_354| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_354|, #memory_int=|v_#memory_int_245|, #length=|v_#length_287|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~back2~0=v_~back2~0_134, #NULL.offset=|v_#NULL.offset_20|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_61|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_26|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_56|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_71|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_35|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_43|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_56|, ~queue2~0.base=v_~queue2~0.base_85, #length=|v_#length_285|, ~front1~0=v_~front1~0_96, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_89|, ~queue2~0.offset=v_~queue2~0.offset_85, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_61|, ~back1~0=v_~back1~0_114, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_69|, ~v_assert~0=v_~v_assert~0_111, #StackHeapBarrier=|v_#StackHeapBarrier_64|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_71|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_31|, ~front2~0=v_~front2~0_100, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|, ~n1~0=v_~n1~0_102, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_77|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_85|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_25|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_69|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_51|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_47|, ~W~0=v_~W~0_87, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39|, ~queue1~0.base=v_~queue1~0.base_75, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|, ~d2~0=v_~d2~0_57, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_43|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_52|, ~n2~0=v_~n2~0_100, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_59|, #NULL.base=|v_#NULL.base_20|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_54|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_49|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_67|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_41|, #valid=|v_#valid_352|, #memory_int=|v_#memory_int_245|, ~queue1~0.offset=v_~queue1~0.offset_75, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_77|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_23|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|, ~d1~0=v_~d1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_~#t2~0#1.offset, ~back2~0, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_main_#t~nondet13#1, ~queue2~0.base, #length, ~front1~0, ULTIMATE.start_main_~#t4~0#1.base, ~queue2~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ~back1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~front2~0, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~n1~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ~W~0, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~d2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~nondet10#1, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, #valid, ~queue1~0.offset, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~d1~0] 4217#[L160-6]don't care [967] L160-6-->L160-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~n2~0_86) (= (store |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1) |v_#valid_326|) (= (store |v_#length_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4)) |v_#length_265|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_56|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= v_~queue1~0.offset_65 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|) (= (select |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102| |v_ULTIMATE.start_create_fresh_int_array_~size#1_112|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue1~0.base_65) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102|, #valid=|v_#valid_327|, #length=|v_#length_266|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_112|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_55|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_111|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_63|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ~queue1~0.base=v_~queue1~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_63|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_61|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|, #valid=|v_#valid_326|, #length=|v_#length_265|, ~queue1~0.offset=v_~queue1~0.offset_65, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ~queue1~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4163#[L160-14]don't care [2022-07-22 12:25:09,978 INFO L750 eck$LassoCheckResult]: Loop: 4163#[L160-14]don't care [943] L160-14-->L160-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|))) (and (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63| 4) (select |v_#length_219| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| |v_ULTIMATE.start_create_fresh_int_array_~size#1_85|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 1)) (= (store |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63| (store (select |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|)) |v_#memory_int_207|) (= (select |v_#valid_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_208|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_43|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_207|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 4163#[L160-14]don't care [2022-07-22 12:25:09,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:09,979 INFO L85 PathProgramCache]: Analyzing trace with hash 32215, now seen corresponding path program 1 times [2022-07-22 12:25:09,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:09,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889205438] [2022-07-22 12:25:09,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:09,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:10,014 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:10,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:10,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:10,043 INFO L85 PathProgramCache]: Analyzing trace with hash 974, now seen corresponding path program 1 times [2022-07-22 12:25:10,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:10,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084892065] [2022-07-22 12:25:10,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:10,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:10,051 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:10,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:10,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:10,058 INFO L85 PathProgramCache]: Analyzing trace with hash 999608, now seen corresponding path program 1 times [2022-07-22 12:25:10,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:10,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508990813] [2022-07-22 12:25:10,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:10,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:10,149 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:10,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:10,330 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:25:12,507 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:12,507 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:12,507 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:12,507 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:12,507 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:12,508 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:12,508 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:12,508 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:12,508 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-prod-cons3.wvr.c_BEv2_Iteration2_Lasso [2022-07-22 12:25:12,508 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:12,508 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:12,513 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:25:12,515 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:25:12,517 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:25:12,518 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:25:12,520 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:25:12,522 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:25:12,524 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:25:12,526 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:25:12,527 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:25:12,531 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:25:12,533 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:25:12,534 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:25:12,536 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:25:12,538 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:25:12,539 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:25:12,541 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:25:12,548 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:25:12,550 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:25:12,551 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:25:12,553 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:25:12,554 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:25:12,556 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:25:12,558 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:25:12,560 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:25:12,562 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:25:12,563 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:25:12,565 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:25:12,566 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:25:12,568 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:25:12,570 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:25:12,571 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:25:12,573 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:25:12,576 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:25:12,577 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:25:12,579 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:25:12,580 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:25:12,581 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:25:12,583 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:25:12,584 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:25:12,586 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:25:12,587 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:25:12,589 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:25:12,592 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:25:13,241 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:25:13,244 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:25:13,245 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:25:13,246 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:25:13,248 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:25:13,250 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:25:13,252 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:25:13,253 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:25:13,254 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:25:13,901 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:25:13,901 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:25:13,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:13,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:13,903 INFO L229 MonitoredProcess]: Starting monitored process 62 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:25:13,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:13,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:13,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:13,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:13,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:13,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:13,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:13,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:13,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-22 12:25:13,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:13,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:13,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:13,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:13,971 INFO L229 MonitoredProcess]: Starting monitored process 63 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:25:13,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:13,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:13,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:13,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:13,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:13,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:13,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:13,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-22 12:25:14,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:14,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,039 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:25:14,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:14,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:14,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:14,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:14,057 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:25:14,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,109 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:25:14,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,113 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:25:14,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:14,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:14,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:14,133 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:25:14,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,178 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:25:14,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,179 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:25:14,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:14,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:14,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:14,196 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:25:14,212 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,249 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:25:14,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,250 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:25:14,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:14,260 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:25:14,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:14,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:14,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-07-22 12:25:14,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,304 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:25:14,307 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:25:14,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:14,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:14,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:14,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:14,321 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-22 12:25:14,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,345 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:25:14,345 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:25:14,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:14,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:14,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:14,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-22 12:25:14,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,381 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:25:14,382 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:25:14,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:14,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:14,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:14,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-07-22 12:25:14,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,420 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:25:14,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:14,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:14,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:14,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:14,434 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:25:14,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-07-22 12:25:14,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,459 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:25:14,460 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:25:14,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:14,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:14,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:14,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:14,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-07-22 12:25:14,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,493 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:25:14,498 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:25:14,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:14,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:14,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:14,518 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:14,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,541 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:25:14,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:14,549 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:25:14,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:14,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:14,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:14,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,605 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:25:14,606 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:25:14,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:14,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:14,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:14,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:14,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,637 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:25:14,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,638 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:25:14,639 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:25:14,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:25:14,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:14,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:14,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:14,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,669 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:25:14,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,670 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:25:14,671 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:25:14,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:14,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:14,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:14,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-07-22 12:25:14,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,704 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:25:14,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:14,707 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:25:14,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:14,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:14,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,739 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:25:14,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,740 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:25:14,741 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:25:14,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:14,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:14,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:14,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:14,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-07-22 12:25:14,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,774 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:25:14,775 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:25:14,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:14,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:14,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:14,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:14,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-07-22 12:25:14,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,806 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:25:14,807 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:25:14,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:14,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:14,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:14,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:14,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,871 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:25:14,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,873 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:25:14,874 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:25:14,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:14,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,885 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:14,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:14,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,926 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:25:14,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,927 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:25:14,927 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:25:14,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:14,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:14,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:14,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:14,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:14,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:14,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:14,983 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:25:14,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:14,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:14,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:14,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:14,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:15,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:15,004 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:25:15,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:15,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,050 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:25:15,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:15,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,061 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:25:15,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:15,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:15,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2022-07-22 12:25:15,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,089 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:25:15,089 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:25:15,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:15,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:15,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:15,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:15,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,123 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:25:15,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,124 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:25:15,125 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:25:15,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:15,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:15,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:15,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,161 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:25:15,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,162 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:25:15,163 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:25:15,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:15,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:15,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:15,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:15,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2022-07-22 12:25:15,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,197 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:25:15,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:15,210 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:25:15,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,212 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:15,212 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:15,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:15,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,239 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:25:15,241 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:25:15,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:15,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:15,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:15,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:15,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,275 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:25:15,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,277 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:25:15,296 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:25:15,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:15,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:15,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:15,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:15,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2022-07-22 12:25:15,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,332 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:25:15,333 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:25:15,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:15,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,342 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:15,342 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:15,346 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2022-07-22 12:25:15,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,370 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:25:15,371 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:25:15,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:15,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:15,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:15,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:15,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-07-22 12:25:15,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,406 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:25:15,407 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:25:15,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:15,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:15,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:15,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:15,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-07-22 12:25:15,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,443 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:25:15,444 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:25:15,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:15,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:15,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:15,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:15,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2022-07-22 12:25:15,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,479 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:25:15,480 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:25:15,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:15,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:15,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:15,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:15,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,513 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:25:15,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,514 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:25:15,515 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:25:15,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:15,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:15,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:15,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:15,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:15,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,549 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:25:15,549 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:25:15,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:15,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:15,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:15,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-07-22 12:25:15,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,601 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:25:15,602 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:25: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:25:15,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:15,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:15,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:15,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,634 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:25:15,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,636 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:25:15,636 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:25:15,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:15,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:15,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:15,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2022-07-22 12:25:15,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,673 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:25:15,674 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:25:15,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:15,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:15,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:15,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:15,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2022-07-22 12:25:15,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,707 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:25:15,708 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:25:15,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:15,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:15,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:15,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,743 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:25:15,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,744 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:25:15,746 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:25:15,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:15,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:15,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:15,758 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2022-07-22 12:25:15,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,782 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:25:15,783 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:25:15,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:15,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:15,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:15,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,819 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:25:15,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,820 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:25:15,821 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:25:15,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:15,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:15,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:15,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2022-07-22 12:25:15,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,869 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:25:15,870 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:25:15,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:15,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:15,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:15,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,905 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:25:15,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,906 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:25:15,907 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:25:15,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:15,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:15,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:15,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:15,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,946 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:25:15,947 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:25:15,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:15,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:15,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:15,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:15,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,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:25:15,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:25:15,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:25:15,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:15,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:16,009 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:25:16,034 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-22 12:25:16,034 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-22 12:25:16,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:16,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:16,035 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:25:16,037 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:25:16,037 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:25:16,046 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:25:16,046 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:25:16,046 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_2) = -1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset - 4*ULTIMATE.start_create_fresh_int_array_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_2 Supporting invariants [] [2022-07-22 12:25:16,069 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:25:16,226 INFO L257 tatePredicateManager]: 35 out of 35 supporting invariants were superfluous and have been removed [2022-07-22 12:25:16,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:16,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:25:16,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:16,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:25:16,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:16,281 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:25:16,282 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:25:16,283 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 759 states and 2896 transitions. cyclomatic complexity: 2289 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:25:16,314 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 759 states and 2896 transitions. cyclomatic complexity: 2289. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 760 states and 2898 transitions. Complement of second has 3 states. [2022-07-22 12:25:16,315 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:25:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:25:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4 transitions. [2022-07-22 12:25:16,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:25:16,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:16,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-22 12:25:16,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:16,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-22 12:25:16,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:16,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 760 states and 2898 transitions. [2022-07-22 12:25:16,333 INFO L131 ngComponentsAnalysis]: Automaton has 150 accepting balls. 684 [2022-07-22 12:25:16,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 760 states to 760 states and 2898 transitions. [2022-07-22 12:25:16,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 757 [2022-07-22 12:25:16,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 758 [2022-07-22 12:25:16,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 760 states and 2898 transitions. [2022-07-22 12:25:16,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:16,352 INFO L220 hiAutomatonCegarLoop]: Abstraction has 760 states and 2898 transitions. [2022-07-22 12:25:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states and 2898 transitions. [2022-07-22 12:25:16,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2022-07-22 12:25:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 760 states have (on average 3.8131578947368423) internal successors, (2898), 759 states have internal predecessors, (2898), 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:25:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 2898 transitions. [2022-07-22 12:25:16,386 INFO L242 hiAutomatonCegarLoop]: Abstraction has 760 states and 2898 transitions. [2022-07-22 12:25:16,386 INFO L425 stractBuchiCegarLoop]: Abstraction has 760 states and 2898 transitions. [2022-07-22 12:25:16,386 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:25:16,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 760 states and 2898 transitions. [2022-07-22 12:25:16,397 INFO L131 ngComponentsAnalysis]: Automaton has 150 accepting balls. 684 [2022-07-22 12:25:16,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:16,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:16,398 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:25:16,398 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:25:16,399 INFO L748 eck$LassoCheckResult]: Stem: 6666#[ULTIMATE.startENTRY]don't care [977] ULTIMATE.startENTRY-->L160-6: Formula: (let ((.cse2 (store |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 1))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85| 1))) (let ((.cse0 (select |v_#memory_int_245| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= (ite (< v_~W~0_87 1073741823) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_77| 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|) (< 0 |v_#StackHeapBarrier_64|) (= v_~queue1~0.offset_75 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|) (= v_~queue2~0.offset_85 0) (= (select |v_#valid_354| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205| 0)) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_77|) (= (store (store (store (store (store |v_#length_287| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_89| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_285|) (= |v_#NULL.offset_20| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| v_~n1~0_102) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_51| 0) (= (select |v_#length_287| 2) 24) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t3~0#1.base_85|) (= (select .cse0 0) 48) (= (select |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= v_~d1~0_58 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|) (= v_~back1~0_114 v_~front1~0_96) (= v_~queue1~0.base_75 0) (= v_~front2~0_100 v_~back2~0_134) (= |v_#NULL.base_20| 0) (= v_~v_assert~0_111 1) (= (select .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85|) 0) (= v_~queue2~0.base_85 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t4~0#1.base_89|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_51| 0) (= (select |v_#length_287| 1) 2) (= (select .cse0 1) 0) (= (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1) |v_#valid_352|) (= (select |v_#valid_354| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (= v_~d2~0_57 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_64|) (= (select |v_#valid_354| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_354|, #memory_int=|v_#memory_int_245|, #length=|v_#length_287|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~back2~0=v_~back2~0_134, #NULL.offset=|v_#NULL.offset_20|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_61|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_26|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_56|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_71|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_35|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_43|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_56|, ~queue2~0.base=v_~queue2~0.base_85, #length=|v_#length_285|, ~front1~0=v_~front1~0_96, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_89|, ~queue2~0.offset=v_~queue2~0.offset_85, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_61|, ~back1~0=v_~back1~0_114, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_69|, ~v_assert~0=v_~v_assert~0_111, #StackHeapBarrier=|v_#StackHeapBarrier_64|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_71|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_31|, ~front2~0=v_~front2~0_100, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|, ~n1~0=v_~n1~0_102, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_77|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_85|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_25|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_69|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_51|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_47|, ~W~0=v_~W~0_87, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39|, ~queue1~0.base=v_~queue1~0.base_75, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|, ~d2~0=v_~d2~0_57, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_43|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_52|, ~n2~0=v_~n2~0_100, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_59|, #NULL.base=|v_#NULL.base_20|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_54|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_49|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_67|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_41|, #valid=|v_#valid_352|, #memory_int=|v_#memory_int_245|, ~queue1~0.offset=v_~queue1~0.offset_75, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_77|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_23|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|, ~d1~0=v_~d1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_~#t2~0#1.offset, ~back2~0, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_main_#t~nondet13#1, ~queue2~0.base, #length, ~front1~0, ULTIMATE.start_main_~#t4~0#1.base, ~queue2~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ~back1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~front2~0, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~n1~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ~W~0, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~d2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~nondet10#1, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, #valid, ~queue1~0.offset, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~d1~0] 6662#[L160-6]don't care [967] L160-6-->L160-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~n2~0_86) (= (store |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1) |v_#valid_326|) (= (store |v_#length_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4)) |v_#length_265|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_56|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= v_~queue1~0.offset_65 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|) (= (select |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102| |v_ULTIMATE.start_create_fresh_int_array_~size#1_112|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue1~0.base_65) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102|, #valid=|v_#valid_327|, #length=|v_#length_266|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_112|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_55|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_111|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_63|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ~queue1~0.base=v_~queue1~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_63|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_61|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|, #valid=|v_#valid_326|, #length=|v_#length_265|, ~queue1~0.offset=v_~queue1~0.offset_65, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ~queue1~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 6606#[L160-14]don't care [973] L160-14-->L140-3: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~queue2~0.base_Out_2) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= 0 v_~W~0_In_1) 1 0)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~queue2~0.offset_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|)) |v_#memory_int_Out_2|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ~queue2~0.base=v_~queue2~0.base_Out_2, #length=|v_#length_In_3|, ~queue2~0.offset=v_~queue2~0.offset_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~queue2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~pre17#1, ~queue2~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 6178#[L140-3]don't care [729] L140-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 6180#[thread1ENTRY, L140-4]don't care [690] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 6528#[L48-4, L140-4]don't care [2022-07-22 12:25:16,399 INFO L750 eck$LassoCheckResult]: Loop: 6528#[L48-4, L140-4]don't care [876] L48-4-->L55: Formula: (and (= v_~v_assert~0_40 |v_thread1Thread1of1ForFork0_~cond~0#1_17|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_17| 256) 0)) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_33|)) InVars {~v_assert~0=v_~v_assert~0_40, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_33|} OutVars{~v_assert~0=v_~v_assert~0_40, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_33|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_17|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 6654#[L55, L140-4]don't care [849] L55-->L48-4: Formula: (let ((.cse0 (* 4 v_~back1~0_65))) (let ((.cse1 (+ v_~queue1~0.offset_37 .cse0))) (and (<= (+ v_~queue1~0.offset_37 .cse0 4) (select |v_#length_125| v_~queue1~0.base_37)) (= v_~back1~0_64 (+ v_~back1~0_65 1)) (<= 0 .cse1) (= (ite (= (select (select |v_#memory_int_115| v_~queue1~0.base_37) .cse1) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_23| 1) |v_thread1Thread1of1ForFork0_~w~0#1_24|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_148| v_~queue1~0.base_37) 1) (not (= (ite (and (<= 0 v_~back1~0_65) (< v_~back1~0_65 v_~n1~0_38)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~queue1~0.base=v_~queue1~0.base_37, ~n1~0=v_~n1~0_38, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_115|, ~back1~0=v_~back1~0_65, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_24|, ~queue1~0.offset=v_~queue1~0.offset_37, #length=|v_#length_125|} OutVars{~n1~0=v_~n1~0_38, ~back1~0=v_~back1~0_64, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_11|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_17|, ~queue1~0.base=v_~queue1~0.base_37, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_11|, #valid=|v_#valid_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_115|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_23|, ~queue1~0.offset=v_~queue1~0.offset_37, #length=|v_#length_125|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~back1~0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 6528#[L48-4, L140-4]don't care [2022-07-22 12:25:16,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:16,400 INFO L85 PathProgramCache]: Analyzing trace with hash 960675407, now seen corresponding path program 1 times [2022-07-22 12:25:16,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:16,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275041968] [2022-07-22 12:25:16,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:16,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:16,464 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:16,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:16,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:16,498 INFO L85 PathProgramCache]: Analyzing trace with hash 28966, now seen corresponding path program 1 times [2022-07-22 12:25:16,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:16,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081040077] [2022-07-22 12:25:16,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:16,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:16,507 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:16,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:16,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:16,515 INFO L85 PathProgramCache]: Analyzing trace with hash -208874508, now seen corresponding path program 1 times [2022-07-22 12:25:16,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:16,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428458848] [2022-07-22 12:25:16,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:16,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:16,654 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:25:16,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:25:16,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428458848] [2022-07-22 12:25:16,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428458848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:25:16,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:25:16,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:25:16,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115380897] [2022-07-22 12:25:16,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:25:16,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:25:16,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:25:16,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:25:16,772 INFO L87 Difference]: Start difference. First operand 760 states and 2898 transitions. cyclomatic complexity: 2290 Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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:25:16,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:25:16,954 INFO L93 Difference]: Finished difference Result 1221 states and 4397 transitions. [2022-07-22 12:25:16,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1221 states and 4397 transitions. [2022-07-22 12:25:16,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:16,990 INFO L131 ngComponentsAnalysis]: Automaton has 238 accepting balls. 948 [2022-07-22 12:25:17,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1221 states to 1147 states and 4151 transitions. [2022-07-22 12:25:17,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1144 [2022-07-22 12:25:17,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1144 [2022-07-22 12:25:17,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1147 states and 4151 transitions. [2022-07-22 12:25:17,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:17,019 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1147 states and 4151 transitions. [2022-07-22 12:25:17,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states and 4151 transitions. [2022-07-22 12:25:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1089. [2022-07-22 12:25:17,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 1089 states have (on average 3.692378328741965) internal successors, (4021), 1088 states have internal predecessors, (4021), 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:25:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 4021 transitions. [2022-07-22 12:25:17,068 INFO L242 hiAutomatonCegarLoop]: Abstraction has 1089 states and 4021 transitions. [2022-07-22 12:25:17,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:25:17,069 INFO L425 stractBuchiCegarLoop]: Abstraction has 1089 states and 4021 transitions. [2022-07-22 12:25:17,069 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:25:17,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1089 states and 4021 transitions. [2022-07-22 12:25:17,082 INFO L131 ngComponentsAnalysis]: Automaton has 224 accepting balls. 906 [2022-07-22 12:25:17,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:17,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:17,083 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:25:17,083 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:25:17,084 INFO L748 eck$LassoCheckResult]: Stem: 9686#[ULTIMATE.startENTRY]don't care [977] ULTIMATE.startENTRY-->L160-6: Formula: (let ((.cse2 (store |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 1))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85| 1))) (let ((.cse0 (select |v_#memory_int_245| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= (ite (< v_~W~0_87 1073741823) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_77| 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|) (< 0 |v_#StackHeapBarrier_64|) (= v_~queue1~0.offset_75 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|) (= v_~queue2~0.offset_85 0) (= (select |v_#valid_354| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205| 0)) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_77|) (= (store (store (store (store (store |v_#length_287| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_89| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_285|) (= |v_#NULL.offset_20| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| v_~n1~0_102) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_51| 0) (= (select |v_#length_287| 2) 24) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t3~0#1.base_85|) (= (select .cse0 0) 48) (= (select |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= v_~d1~0_58 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|) (= v_~back1~0_114 v_~front1~0_96) (= v_~queue1~0.base_75 0) (= v_~front2~0_100 v_~back2~0_134) (= |v_#NULL.base_20| 0) (= v_~v_assert~0_111 1) (= (select .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85|) 0) (= v_~queue2~0.base_85 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t4~0#1.base_89|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_51| 0) (= (select |v_#length_287| 1) 2) (= (select .cse0 1) 0) (= (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1) |v_#valid_352|) (= (select |v_#valid_354| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (= v_~d2~0_57 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_64|) (= (select |v_#valid_354| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_354|, #memory_int=|v_#memory_int_245|, #length=|v_#length_287|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~back2~0=v_~back2~0_134, #NULL.offset=|v_#NULL.offset_20|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_61|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_26|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_56|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_71|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_35|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_43|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_56|, ~queue2~0.base=v_~queue2~0.base_85, #length=|v_#length_285|, ~front1~0=v_~front1~0_96, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_89|, ~queue2~0.offset=v_~queue2~0.offset_85, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_61|, ~back1~0=v_~back1~0_114, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_69|, ~v_assert~0=v_~v_assert~0_111, #StackHeapBarrier=|v_#StackHeapBarrier_64|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_71|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_31|, ~front2~0=v_~front2~0_100, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|, ~n1~0=v_~n1~0_102, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_77|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_85|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_25|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_69|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_51|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_47|, ~W~0=v_~W~0_87, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39|, ~queue1~0.base=v_~queue1~0.base_75, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|, ~d2~0=v_~d2~0_57, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_43|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_52|, ~n2~0=v_~n2~0_100, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_59|, #NULL.base=|v_#NULL.base_20|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_54|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_49|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_67|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_41|, #valid=|v_#valid_352|, #memory_int=|v_#memory_int_245|, ~queue1~0.offset=v_~queue1~0.offset_75, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_77|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_23|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|, ~d1~0=v_~d1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_~#t2~0#1.offset, ~back2~0, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_main_#t~nondet13#1, ~queue2~0.base, #length, ~front1~0, ULTIMATE.start_main_~#t4~0#1.base, ~queue2~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ~back1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~front2~0, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~n1~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ~W~0, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~d2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~nondet10#1, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, #valid, ~queue1~0.offset, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~d1~0] 9644#[L160-6]don't care [921] L160-6-->L160-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1))) (and (= (select |v_#valid_224| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| |v_ULTIMATE.start_create_fresh_int_array_~size#1_67|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1 4) (select |v_#length_179| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 1)) (= (store |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|)) |v_#memory_int_177|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_178|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_37|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_177|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 9646#[L160-6]don't care [967] L160-6-->L160-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~n2~0_86) (= (store |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1) |v_#valid_326|) (= (store |v_#length_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4)) |v_#length_265|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_56|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= v_~queue1~0.offset_65 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|) (= (select |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102| |v_ULTIMATE.start_create_fresh_int_array_~size#1_112|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue1~0.base_65) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102|, #valid=|v_#valid_327|, #length=|v_#length_266|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_112|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_55|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_111|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_63|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ~queue1~0.base=v_~queue1~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_63|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_61|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|, #valid=|v_#valid_326|, #length=|v_#length_265|, ~queue1~0.offset=v_~queue1~0.offset_65, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ~queue1~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 9648#[L160-14]don't care [973] L160-14-->L140-3: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~queue2~0.base_Out_2) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= 0 v_~W~0_In_1) 1 0)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~queue2~0.offset_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|)) |v_#memory_int_Out_2|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ~queue2~0.base=v_~queue2~0.base_Out_2, #length=|v_#length_In_3|, ~queue2~0.offset=v_~queue2~0.offset_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~queue2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~pre17#1, ~queue2~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 9918#[L140-3]don't care [729] L140-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 9914#[thread1ENTRY, L140-4]don't care [690] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 9916#[L48-4, L140-4]don't care [2022-07-22 12:25:17,084 INFO L750 eck$LassoCheckResult]: Loop: 9916#[L48-4, L140-4]don't care [876] L48-4-->L55: Formula: (and (= v_~v_assert~0_40 |v_thread1Thread1of1ForFork0_~cond~0#1_17|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_17| 256) 0)) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_33|)) InVars {~v_assert~0=v_~v_assert~0_40, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_33|} OutVars{~v_assert~0=v_~v_assert~0_40, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_33|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_17|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 9950#[L55, L140-4]don't care [849] L55-->L48-4: Formula: (let ((.cse0 (* 4 v_~back1~0_65))) (let ((.cse1 (+ v_~queue1~0.offset_37 .cse0))) (and (<= (+ v_~queue1~0.offset_37 .cse0 4) (select |v_#length_125| v_~queue1~0.base_37)) (= v_~back1~0_64 (+ v_~back1~0_65 1)) (<= 0 .cse1) (= (ite (= (select (select |v_#memory_int_115| v_~queue1~0.base_37) .cse1) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_23| 1) |v_thread1Thread1of1ForFork0_~w~0#1_24|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_148| v_~queue1~0.base_37) 1) (not (= (ite (and (<= 0 v_~back1~0_65) (< v_~back1~0_65 v_~n1~0_38)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~queue1~0.base=v_~queue1~0.base_37, ~n1~0=v_~n1~0_38, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_115|, ~back1~0=v_~back1~0_65, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_24|, ~queue1~0.offset=v_~queue1~0.offset_37, #length=|v_#length_125|} OutVars{~n1~0=v_~n1~0_38, ~back1~0=v_~back1~0_64, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_11|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_17|, ~queue1~0.base=v_~queue1~0.base_37, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_11|, #valid=|v_#valid_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_115|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_23|, ~queue1~0.offset=v_~queue1~0.offset_37, #length=|v_#length_125|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~back1~0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 9916#[L48-4, L140-4]don't care [2022-07-22 12:25:17,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:17,085 INFO L85 PathProgramCache]: Analyzing trace with hash -326257784, now seen corresponding path program 1 times [2022-07-22 12:25:17,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:17,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331027745] [2022-07-22 12:25:17,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:17,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:17,119 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:17,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:17,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:17,148 INFO L85 PathProgramCache]: Analyzing trace with hash 28966, now seen corresponding path program 2 times [2022-07-22 12:25:17,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:17,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121022906] [2022-07-22 12:25:17,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:17,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:17,158 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:17,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:17,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:17,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1089811, now seen corresponding path program 1 times [2022-07-22 12:25:17,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:17,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874444282] [2022-07-22 12:25:17,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:17,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:17,232 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:17,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:20,514 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:20,514 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:20,514 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:20,514 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:20,514 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:20,514 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:20,515 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:20,515 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:20,515 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-prod-cons3.wvr.c_BEv2_Iteration4_Lasso [2022-07-22 12:25:20,515 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:20,515 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:20,521 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:25:20,525 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:25:20,535 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:25:20,536 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:25:20,538 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:25:20,540 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:25:20,541 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:25:20,542 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:25:20,544 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:25:20,545 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:25:20,547 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:25:20,548 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:25:20,552 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:25:20,553 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:25:20,555 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:25:20,556 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:25:20,558 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:25:20,559 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:25:20,560 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:25:20,562 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:25:20,563 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:25:20,565 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:25:20,572 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:25:20,575 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:25:20,577 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:25:20,579 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:25:20,580 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:25:20,582 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:25:20,584 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:25:20,585 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:25:20,590 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:25:20,591 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:25:20,592 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:25:20,596 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:25:20,597 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:25:20,598 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:25:20,600 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:25:21,415 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:25:21,417 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:25:21,418 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:25:21,420 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:25:21,422 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:25:21,424 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:25:21,425 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:25:21,426 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:25:21,428 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:25:21,429 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:25:21,431 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:25:21,432 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:25:21,435 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:25:21,439 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:25:21,441 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:25:21,442 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:25:22,322 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:25:22,322 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:25:22,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:22,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:22,323 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:25:22,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:22,331 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:25:22,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:22,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:22,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:22,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:22,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:22,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:22,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:22,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:22,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:22,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:22,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:22,381 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:25:22,382 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:25:22,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:22,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:22,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:22,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:22,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:22,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:22,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:22,405 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:25:22,413 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-22 12:25:22,413 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-07-22 12:25:22,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:22,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:22,414 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:25:22,415 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:25:22,415 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:25:22,424 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:25:22,424 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:25:22,424 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_~w~0#1) = 1*thread1Thread1of1ForFork0_~w~0#1 Supporting invariants [] [2022-07-22 12:25:22,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2022-07-22 12:25:22,628 INFO L257 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2022-07-22 12:25:22,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:22,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:25:22,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:22,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:25:22,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:22,706 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:25:22,707 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:25:22,707 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1089 states and 4021 transitions. cyclomatic complexity: 3159 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:25:22,896 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1089 states and 4021 transitions. cyclomatic complexity: 3159. 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 2660 states and 10363 transitions. Complement of second has 5 states. [2022-07-22 12:25:22,896 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:25:22,897 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:25:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-07-22 12:25:22,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 12:25:22,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:22,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:25:22,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:22,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 6 letters. Loop has 4 letters. [2022-07-22 12:25:22,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:22,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2660 states and 10363 transitions. [2022-07-22 12:25:23,009 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:25:23,016 INFO L131 ngComponentsAnalysis]: Automaton has 273 accepting balls. 1090 [2022-07-22 12:25:23,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2660 states to 2564 states and 10019 transitions. [2022-07-22 12:25:23,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1553 [2022-07-22 12:25:23,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2239 [2022-07-22 12:25:23,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2564 states and 10019 transitions. [2022-07-22 12:25:23,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:25:23,078 INFO L220 hiAutomatonCegarLoop]: Abstraction has 2564 states and 10019 transitions. [2022-07-22 12:25:23,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states and 10019 transitions. [2022-07-22 12:25:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1699. [2022-07-22 12:25:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1699 states have (on average 4.081224249558564) internal successors, (6934), 1698 states have internal predecessors, (6934), 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:25:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 6934 transitions. [2022-07-22 12:25:23,172 INFO L242 hiAutomatonCegarLoop]: Abstraction has 1699 states and 6934 transitions. [2022-07-22 12:25:23,172 INFO L425 stractBuchiCegarLoop]: Abstraction has 1699 states and 6934 transitions. [2022-07-22 12:25:23,172 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:25:23,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1699 states and 6934 transitions. [2022-07-22 12:25:23,192 INFO L131 ngComponentsAnalysis]: Automaton has 249 accepting balls. 1018 [2022-07-22 12:25:23,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:23,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:23,193 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:23,193 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:25:23,194 INFO L748 eck$LassoCheckResult]: Stem: 15798#[ULTIMATE.startENTRY]don't care [977] ULTIMATE.startENTRY-->L160-6: Formula: (let ((.cse2 (store |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 1))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85| 1))) (let ((.cse0 (select |v_#memory_int_245| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= (ite (< v_~W~0_87 1073741823) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_77| 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|) (< 0 |v_#StackHeapBarrier_64|) (= v_~queue1~0.offset_75 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|) (= v_~queue2~0.offset_85 0) (= (select |v_#valid_354| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205| 0)) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_77|) (= (store (store (store (store (store |v_#length_287| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_89| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_285|) (= |v_#NULL.offset_20| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| v_~n1~0_102) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_51| 0) (= (select |v_#length_287| 2) 24) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t3~0#1.base_85|) (= (select .cse0 0) 48) (= (select |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= v_~d1~0_58 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|) (= v_~back1~0_114 v_~front1~0_96) (= v_~queue1~0.base_75 0) (= v_~front2~0_100 v_~back2~0_134) (= |v_#NULL.base_20| 0) (= v_~v_assert~0_111 1) (= (select .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85|) 0) (= v_~queue2~0.base_85 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t4~0#1.base_89|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_51| 0) (= (select |v_#length_287| 1) 2) (= (select .cse0 1) 0) (= (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1) |v_#valid_352|) (= (select |v_#valid_354| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (= v_~d2~0_57 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_64|) (= (select |v_#valid_354| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_354|, #memory_int=|v_#memory_int_245|, #length=|v_#length_287|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~back2~0=v_~back2~0_134, #NULL.offset=|v_#NULL.offset_20|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_61|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_26|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_56|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_71|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_35|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_43|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_56|, ~queue2~0.base=v_~queue2~0.base_85, #length=|v_#length_285|, ~front1~0=v_~front1~0_96, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_89|, ~queue2~0.offset=v_~queue2~0.offset_85, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_61|, ~back1~0=v_~back1~0_114, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_69|, ~v_assert~0=v_~v_assert~0_111, #StackHeapBarrier=|v_#StackHeapBarrier_64|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_71|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_31|, ~front2~0=v_~front2~0_100, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|, ~n1~0=v_~n1~0_102, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_77|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_85|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_25|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_69|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_51|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_47|, ~W~0=v_~W~0_87, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39|, ~queue1~0.base=v_~queue1~0.base_75, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|, ~d2~0=v_~d2~0_57, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_43|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_52|, ~n2~0=v_~n2~0_100, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_59|, #NULL.base=|v_#NULL.base_20|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_54|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_49|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_67|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_41|, #valid=|v_#valid_352|, #memory_int=|v_#memory_int_245|, ~queue1~0.offset=v_~queue1~0.offset_75, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_77|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_23|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|, ~d1~0=v_~d1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_~#t2~0#1.offset, ~back2~0, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_main_#t~nondet13#1, ~queue2~0.base, #length, ~front1~0, ULTIMATE.start_main_~#t4~0#1.base, ~queue2~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ~back1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~front2~0, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~n1~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ~W~0, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~d2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~nondet10#1, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, #valid, ~queue1~0.offset, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~d1~0] 15692#[L160-6]don't care [921] L160-6-->L160-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1))) (and (= (select |v_#valid_224| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| |v_ULTIMATE.start_create_fresh_int_array_~size#1_67|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1 4) (select |v_#length_179| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 1)) (= (store |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|)) |v_#memory_int_177|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_178|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_37|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_177|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 15694#[L160-6]don't care [967] L160-6-->L160-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~n2~0_86) (= (store |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1) |v_#valid_326|) (= (store |v_#length_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4)) |v_#length_265|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_56|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= v_~queue1~0.offset_65 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|) (= (select |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102| |v_ULTIMATE.start_create_fresh_int_array_~size#1_112|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue1~0.base_65) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102|, #valid=|v_#valid_327|, #length=|v_#length_266|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_112|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_55|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_111|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_63|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ~queue1~0.base=v_~queue1~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_63|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_61|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|, #valid=|v_#valid_326|, #length=|v_#length_265|, ~queue1~0.offset=v_~queue1~0.offset_65, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ~queue1~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 15696#[L160-14]don't care [973] L160-14-->L140-3: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~queue2~0.base_Out_2) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= 0 v_~W~0_In_1) 1 0)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~queue2~0.offset_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|)) |v_#memory_int_Out_2|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ~queue2~0.base=v_~queue2~0.base_Out_2, #length=|v_#length_In_3|, ~queue2~0.offset=v_~queue2~0.offset_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~queue2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~pre17#1, ~queue2~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 15888#[L140-3]don't care [729] L140-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 15880#[thread1ENTRY, L140-4]don't care [690] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 15882#[L48-4, L140-4]don't care [926] L140-4-->L141-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_185| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= |v_#pthreadsForks_91| (+ |v_#pthreadsForks_92| 1)) (= (select |v_#valid_230| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (= |v_ULTIMATE.start_main_#t~pre19#1_17| |v_#pthreadsForks_92|) (= (store |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre19#1_17|)) |v_#memory_int_187|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_92|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_230|, #memory_int=|v_#memory_int_188|, #length=|v_#length_185|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_91|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_230|, #memory_int=|v_#memory_int_187|, #length=|v_#length_185|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_17|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] 15750#[L48-4, L141-3]don't care [2022-07-22 12:25:23,195 INFO L750 eck$LassoCheckResult]: Loop: 15750#[L48-4, L141-3]don't care [876] L48-4-->L55: Formula: (and (= v_~v_assert~0_40 |v_thread1Thread1of1ForFork0_~cond~0#1_17|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_17| 256) 0)) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_33|)) InVars {~v_assert~0=v_~v_assert~0_40, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_33|} OutVars{~v_assert~0=v_~v_assert~0_40, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_33|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_17|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 16202#[L55, L141-3]don't care [849] L55-->L48-4: Formula: (let ((.cse0 (* 4 v_~back1~0_65))) (let ((.cse1 (+ v_~queue1~0.offset_37 .cse0))) (and (<= (+ v_~queue1~0.offset_37 .cse0 4) (select |v_#length_125| v_~queue1~0.base_37)) (= v_~back1~0_64 (+ v_~back1~0_65 1)) (<= 0 .cse1) (= (ite (= (select (select |v_#memory_int_115| v_~queue1~0.base_37) .cse1) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_23| 1) |v_thread1Thread1of1ForFork0_~w~0#1_24|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_148| v_~queue1~0.base_37) 1) (not (= (ite (and (<= 0 v_~back1~0_65) (< v_~back1~0_65 v_~n1~0_38)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~queue1~0.base=v_~queue1~0.base_37, ~n1~0=v_~n1~0_38, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_115|, ~back1~0=v_~back1~0_65, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_24|, ~queue1~0.offset=v_~queue1~0.offset_37, #length=|v_#length_125|} OutVars{~n1~0=v_~n1~0_38, ~back1~0=v_~back1~0_64, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_11|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_17|, ~queue1~0.base=v_~queue1~0.base_37, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_11|, #valid=|v_#valid_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_115|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_23|, ~queue1~0.offset=v_~queue1~0.offset_37, #length=|v_#length_125|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~back1~0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 15750#[L48-4, L141-3]don't care [2022-07-22 12:25:23,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:23,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1524055786, now seen corresponding path program 1 times [2022-07-22 12:25:23,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:23,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595032163] [2022-07-22 12:25:23,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:23,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:23,285 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:23,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:23,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:23,316 INFO L85 PathProgramCache]: Analyzing trace with hash 28966, now seen corresponding path program 3 times [2022-07-22 12:25:23,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:23,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389984046] [2022-07-22 12:25:23,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:23,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:23,324 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:23,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:23,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:23,331 INFO L85 PathProgramCache]: Analyzing trace with hash -33734405, now seen corresponding path program 1 times [2022-07-22 12:25:23,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:23,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271391006] [2022-07-22 12:25:23,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:23,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:23,380 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:23,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:26,648 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:26,648 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:26,648 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:26,648 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:26,648 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:26,648 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:26,648 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:26,649 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:26,649 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-prod-cons3.wvr.c_BEv2_Iteration5_Lasso [2022-07-22 12:25:26,649 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:26,649 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:26,654 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:25:26,657 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:25:26,659 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:25:26,660 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:25:26,662 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:25:26,666 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:25:27,786 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:25:27,788 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:25:27,797 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:25:27,799 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:25:27,801 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:25:27,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:25:27,805 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:25:27,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:25:27,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:25:27,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:25:27,811 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:25:27,813 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:25:27,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:25:27,817 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:25:27,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:25:27,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:25:27,822 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:25:27,824 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:25:27,826 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:25:27,828 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:25:27,830 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:25:27,832 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:25:27,836 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:25:27,837 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:25:27,839 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:25:27,841 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:25:27,842 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:25:27,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:25:27,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:25:27,865 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:25:27,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:25:27,872 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:25:27,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:25:27,875 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:25:27,876 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:25:27,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:25:27,879 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:25:27,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:25:27,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:25:27,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:25:27,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:25:27,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:25:27,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:25:27,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:25:27,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:25:27,903 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:25:28,781 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:25:28,781 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:25:28,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:28,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:28,787 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:25:28,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:28,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:28,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:28,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:28,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:28,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:28,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:28,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:28,799 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:25:28,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:28,822 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:25:28,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:28,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:28,823 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:25:28,823 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:25:28,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:28,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:28,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:28,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:28,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:28,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:28,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:28,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:28,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:28,855 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:25:28,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:28,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:28,856 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:25:28,857 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:25:28,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:28,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:28,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:28,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:28,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:28,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:28,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:28,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:28,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:28,891 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:25:28,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:28,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:28,892 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:25:28,893 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:25:28,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:28,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:28,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:28,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:28,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:28,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:28,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:28,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:28,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2022-07-22 12:25:28,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:28,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:28,930 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:25:28,930 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:25:28,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:28,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:28,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:28,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:28,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:28,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:28,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:28,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:28,941 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:28,965 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:25:28,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:28,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:28,966 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:25:28,967 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:25:28,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:28,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:28,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:28,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:28,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:28,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:28,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:28,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:29,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2022-07-22 12:25:29,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,004 INFO L229 MonitoredProcess]: Starting monitored process 120 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:25:29,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-07-22 12:25:29,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:29,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:29,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:29,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:29,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:29,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:29,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:29,029 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:29,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2022-07-22 12:25:29,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,053 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:25:29,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:29,055 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:25:29,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:29,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:29,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:29,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:29,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:29,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:29,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:29,094 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:25:29,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,095 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:25:29,096 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:25:29,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:25:29,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:29,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:29,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:29,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:29,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:29,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:29,123 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:25:29,141 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-22 12:25:29,141 INFO L444 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-07-22 12:25:29,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:29,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:29,142 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:25:29,143 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:25:29,143 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:25:29,151 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:25:29,151 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:25:29,151 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n1~0, ~back1~0) = 1*~n1~0 - 1*~back1~0 Supporting invariants [] [2022-07-22 12:25:29,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2022-07-22 12:25:29,456 INFO L257 tatePredicateManager]: 44 out of 44 supporting invariants were superfluous and have been removed [2022-07-22 12:25:29,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:29,490 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:25:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:29,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:25:29,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:29,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:25:29,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:29,535 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:25:29,537 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:25:29,537 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1699 states and 6934 transitions. cyclomatic complexity: 5548 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:25:29,718 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1699 states and 6934 transitions. cyclomatic complexity: 5548. 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 4968 states and 22034 transitions. Complement of second has 4 states. [2022-07-22 12:25:29,719 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:25:29,720 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:25:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-07-22 12:25:29,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 57 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:25:29,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:29,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 57 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:25:29,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:29,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 57 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-22 12:25:29,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:29,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4968 states and 22034 transitions. [2022-07-22 12:25:29,816 INFO L131 ngComponentsAnalysis]: Automaton has 252 accepting balls. 960 [2022-07-22 12:25:29,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4968 states to 3533 states and 15518 transitions. [2022-07-22 12:25:29,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1506 [2022-07-22 12:25:29,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2134 [2022-07-22 12:25:29,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3533 states and 15518 transitions. [2022-07-22 12:25:29,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:25:29,892 INFO L220 hiAutomatonCegarLoop]: Abstraction has 3533 states and 15518 transitions. [2022-07-22 12:25:29,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3533 states and 15518 transitions. [2022-07-22 12:25:29,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3533 to 2079. [2022-07-22 12:25:29,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2079 states have (on average 4.500721500721501) internal successors, (9357), 2078 states have internal predecessors, (9357), 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:25:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 9357 transitions. [2022-07-22 12:25:29,999 INFO L242 hiAutomatonCegarLoop]: Abstraction has 2079 states and 9357 transitions. [2022-07-22 12:25:29,999 INFO L425 stractBuchiCegarLoop]: Abstraction has 2079 states and 9357 transitions. [2022-07-22 12:25:29,999 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:25:29,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2079 states and 9357 transitions. [2022-07-22 12:25:30,022 INFO L131 ngComponentsAnalysis]: Automaton has 208 accepting balls. 792 [2022-07-22 12:25:30,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:30,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:30,023 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:30,023 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:25:30,024 INFO L748 eck$LassoCheckResult]: Stem: 24769#[ULTIMATE.startENTRY]don't care [977] ULTIMATE.startENTRY-->L160-6: Formula: (let ((.cse2 (store |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 1))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85| 1))) (let ((.cse0 (select |v_#memory_int_245| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= (ite (< v_~W~0_87 1073741823) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_77| 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|) (< 0 |v_#StackHeapBarrier_64|) (= v_~queue1~0.offset_75 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|) (= v_~queue2~0.offset_85 0) (= (select |v_#valid_354| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205| 0)) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_77|) (= (store (store (store (store (store |v_#length_287| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_89| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_285|) (= |v_#NULL.offset_20| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| v_~n1~0_102) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_51| 0) (= (select |v_#length_287| 2) 24) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t3~0#1.base_85|) (= (select .cse0 0) 48) (= (select |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= v_~d1~0_58 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|) (= v_~back1~0_114 v_~front1~0_96) (= v_~queue1~0.base_75 0) (= v_~front2~0_100 v_~back2~0_134) (= |v_#NULL.base_20| 0) (= v_~v_assert~0_111 1) (= (select .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85|) 0) (= v_~queue2~0.base_85 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t4~0#1.base_89|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_51| 0) (= (select |v_#length_287| 1) 2) (= (select .cse0 1) 0) (= (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1) |v_#valid_352|) (= (select |v_#valid_354| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (= v_~d2~0_57 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_64|) (= (select |v_#valid_354| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_354|, #memory_int=|v_#memory_int_245|, #length=|v_#length_287|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~back2~0=v_~back2~0_134, #NULL.offset=|v_#NULL.offset_20|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_61|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_26|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_56|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_71|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_35|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_43|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_56|, ~queue2~0.base=v_~queue2~0.base_85, #length=|v_#length_285|, ~front1~0=v_~front1~0_96, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_89|, ~queue2~0.offset=v_~queue2~0.offset_85, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_61|, ~back1~0=v_~back1~0_114, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_69|, ~v_assert~0=v_~v_assert~0_111, #StackHeapBarrier=|v_#StackHeapBarrier_64|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_71|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_31|, ~front2~0=v_~front2~0_100, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|, ~n1~0=v_~n1~0_102, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_77|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_85|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_25|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_69|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_51|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_47|, ~W~0=v_~W~0_87, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39|, ~queue1~0.base=v_~queue1~0.base_75, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|, ~d2~0=v_~d2~0_57, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_43|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_52|, ~n2~0=v_~n2~0_100, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_59|, #NULL.base=|v_#NULL.base_20|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_54|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_49|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_67|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_41|, #valid=|v_#valid_352|, #memory_int=|v_#memory_int_245|, ~queue1~0.offset=v_~queue1~0.offset_75, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_77|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_23|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|, ~d1~0=v_~d1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_~#t2~0#1.offset, ~back2~0, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_main_#t~nondet13#1, ~queue2~0.base, #length, ~front1~0, ULTIMATE.start_main_~#t4~0#1.base, ~queue2~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ~back1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~front2~0, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~n1~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ~W~0, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~d2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~nondet10#1, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, #valid, ~queue1~0.offset, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~d1~0] 24583#[L160-6]don't care [921] L160-6-->L160-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1))) (and (= (select |v_#valid_224| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| |v_ULTIMATE.start_create_fresh_int_array_~size#1_67|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1 4) (select |v_#length_179| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 1)) (= (store |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|)) |v_#memory_int_177|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_178|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_37|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_177|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 24585#[L160-6]don't care [967] L160-6-->L160-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~n2~0_86) (= (store |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1) |v_#valid_326|) (= (store |v_#length_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4)) |v_#length_265|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_56|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= v_~queue1~0.offset_65 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|) (= (select |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102| |v_ULTIMATE.start_create_fresh_int_array_~size#1_112|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue1~0.base_65) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102|, #valid=|v_#valid_327|, #length=|v_#length_266|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_112|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_55|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_111|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_63|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ~queue1~0.base=v_~queue1~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_63|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_61|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|, #valid=|v_#valid_326|, #length=|v_#length_265|, ~queue1~0.offset=v_~queue1~0.offset_65, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ~queue1~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 24587#[L160-14]don't care [973] L160-14-->L140-3: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~queue2~0.base_Out_2) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= 0 v_~W~0_In_1) 1 0)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~queue2~0.offset_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|)) |v_#memory_int_Out_2|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ~queue2~0.base=v_~queue2~0.base_Out_2, #length=|v_#length_In_3|, ~queue2~0.offset=v_~queue2~0.offset_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~queue2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~pre17#1, ~queue2~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 24901#[L140-3]don't care [729] L140-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 24897#[thread1ENTRY, L140-4]don't care [926] L140-4-->L141-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_185| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= |v_#pthreadsForks_91| (+ |v_#pthreadsForks_92| 1)) (= (select |v_#valid_230| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (= |v_ULTIMATE.start_main_#t~pre19#1_17| |v_#pthreadsForks_92|) (= (store |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre19#1_17|)) |v_#memory_int_187|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_92|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_230|, #memory_int=|v_#memory_int_188|, #length=|v_#length_185|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_91|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_230|, #memory_int=|v_#memory_int_187|, #length=|v_#length_185|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_17|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] 24795#[thread1ENTRY, L141-3]don't care [735] L141-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_2) (= |v_ULTIMATE.start_main_#t~pre19#1_6| v_thread2Thread1of1ForFork2_thidvar0_2) (= 0 v_thread2Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_10|, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_10|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_4|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_4|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_4|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_4|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_2, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_4|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~temp~0#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_#t~post7#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_thidvar2, thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_#t~mem4#1] 24799#[thread1ENTRY, L141-4, thread2ENTRY]don't care [796] thread2ENTRY-->L86: Formula: (= |v_thread2Thread1of1ForFork2_~cond~1#1_11| v_~v_assert~0_14) InVars {~v_assert~0=v_~v_assert~0_14} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_11|, ~v_assert~0=v_~v_assert~0_14, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~temp~0#1] 24603#[thread1ENTRY, L141-4, L86]don't care [2022-07-22 12:25:30,025 INFO L750 eck$LassoCheckResult]: Loop: 24603#[thread1ENTRY, L141-4, L86]don't care [838] L86-->L75: Formula: (let ((.cse1 (* v_~front1~0_43 4))) (let ((.cse0 (+ v_~queue1~0.offset_33 .cse1))) (and (= (+ v_~front1~0_43 1) v_~front1~0_42) (= (select (select |v_#memory_int_107| v_~queue1~0.base_33) .cse0) |v_thread2Thread1of1ForFork2_~temp~0#1_21|) (<= (+ v_~queue1~0.offset_33 .cse1 4) (select |v_#length_119| v_~queue1~0.base_33)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|) (= (ite (and (<= 0 v_~front1~0_43) (< v_~front1~0_43 v_~n1~0_34) (< v_~front1~0_43 v_~back1~0_56)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_15| 256) 0)) (= (select |v_#valid_142| v_~queue1~0.base_33) 1) (<= 0 .cse0)))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, ~queue1~0.base=v_~queue1~0.base_33, ~n1~0=v_~n1~0_34, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~back1~0=v_~back1~0_56, ~front1~0=v_~front1~0_43, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_21|, ~n1~0=v_~n1~0_34, ~back1~0=v_~back1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, ~queue1~0.base=v_~queue1~0.base_33, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_7|, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~front1~0=v_~front1~0_42, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~temp~0#1, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem4#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~front1~0] 22019#[thread1ENTRY, L141-4, L75]don't care [768] L75-->L83: Formula: (let ((.cse1 (* 4 v_~back2~0_53))) (let ((.cse0 (+ v_~queue2~0.offset_31 .cse1))) (and (not (= (ite (and (< v_~back2~0_53 v_~n2~0_28) (<= 0 v_~back2~0_53)) 1 0) 0)) (= (select |v_#valid_98| v_~queue2~0.base_31) 1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (+ v_~back2~0_53 1) v_~back2~0_52) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (= (+ |v_thread2Thread1of1ForFork2_~temp~0#1_13| 1) (select (select |v_#memory_int_77| v_~queue2~0.base_31) .cse0)) 1 0)) (= v_~d1~0_4 (+ v_~d1~0_5 |v_thread2Thread1of1ForFork2_~temp~0#1_13|)) (<= (+ v_~queue2~0.offset_31 .cse1 4) (select |v_#length_85| v_~queue2~0.base_31))))) InVars {thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, #valid=|v_#valid_98|, ~back2~0=v_~back2~0_53, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_5} OutVars{thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_7|, ~back2~0=v_~back2~0_52, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem6#1, ~back2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~d1~0] 22021#[thread1ENTRY, L141-4, L83]don't care [713] L83-->L86: Formula: (= v_~v_assert~0_2 |v_thread2Thread1of1ForFork2_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_7|, ~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1] 24603#[thread1ENTRY, L141-4, L86]don't care [2022-07-22 12:25:30,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:30,025 INFO L85 PathProgramCache]: Analyzing trace with hash -867439, now seen corresponding path program 1 times [2022-07-22 12:25:30,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:30,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428510007] [2022-07-22 12:25:30,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:30,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:30,071 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:30,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:30,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:30,099 INFO L85 PathProgramCache]: Analyzing trace with hash 859630, now seen corresponding path program 1 times [2022-07-22 12:25:30,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:30,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520046662] [2022-07-22 12:25:30,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:30,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:30,110 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:30,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:30,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:30,120 INFO L85 PathProgramCache]: Analyzing trace with hash -71241634, now seen corresponding path program 1 times [2022-07-22 12:25:30,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:30,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010574961] [2022-07-22 12:25:30,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:30,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:30,169 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:25:30,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:25:30,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010574961] [2022-07-22 12:25:30,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010574961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:25:30,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:25:30,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:25:30,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502952136] [2022-07-22 12:25:30,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:25:30,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:25:30,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:25:30,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:25:30,445 INFO L87 Difference]: Start difference. First operand 2079 states and 9357 transitions. cyclomatic complexity: 7632 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:25:30,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:25:30,622 INFO L93 Difference]: Finished difference Result 3099 states and 13209 transitions. [2022-07-22 12:25:30,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3099 states and 13209 transitions. [2022-07-22 12:25:30,669 INFO L131 ngComponentsAnalysis]: Automaton has 208 accepting balls. 792 [2022-07-22 12:25:30,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3099 states to 2079 states and 9355 transitions. [2022-07-22 12:25:30,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1145 [2022-07-22 12:25:30,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1145 [2022-07-22 12:25:30,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2079 states and 9355 transitions. [2022-07-22 12:25:30,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:25:30,710 INFO L220 hiAutomatonCegarLoop]: Abstraction has 2079 states and 9355 transitions. [2022-07-22 12:25:30,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states and 9355 transitions. [2022-07-22 12:25:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 2079. [2022-07-22 12:25:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2079 states have (on average 4.4997594997595) internal successors, (9355), 2078 states have internal predecessors, (9355), 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:25:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 9355 transitions. [2022-07-22 12:25:30,801 INFO L242 hiAutomatonCegarLoop]: Abstraction has 2079 states and 9355 transitions. [2022-07-22 12:25:30,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:25:30,802 INFO L425 stractBuchiCegarLoop]: Abstraction has 2079 states and 9355 transitions. [2022-07-22 12:25:30,802 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 12:25:30,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2079 states and 9355 transitions. [2022-07-22 12:25:30,820 INFO L131 ngComponentsAnalysis]: Automaton has 208 accepting balls. 792 [2022-07-22 12:25:30,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:30,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:30,821 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:30,821 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:25:30,822 INFO L748 eck$LassoCheckResult]: Stem: 32213#[ULTIMATE.startENTRY]don't care [977] ULTIMATE.startENTRY-->L160-6: Formula: (let ((.cse2 (store |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 1))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85| 1))) (let ((.cse0 (select |v_#memory_int_245| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= (ite (< v_~W~0_87 1073741823) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_77| 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|) (< 0 |v_#StackHeapBarrier_64|) (= v_~queue1~0.offset_75 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|) (= v_~queue2~0.offset_85 0) (= (select |v_#valid_354| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205| 0)) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_77|) (= (store (store (store (store (store |v_#length_287| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_89| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_285|) (= |v_#NULL.offset_20| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| v_~n1~0_102) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_51| 0) (= (select |v_#length_287| 2) 24) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t3~0#1.base_85|) (= (select .cse0 0) 48) (= (select |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= v_~d1~0_58 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|) (= v_~back1~0_114 v_~front1~0_96) (= v_~queue1~0.base_75 0) (= v_~front2~0_100 v_~back2~0_134) (= |v_#NULL.base_20| 0) (= v_~v_assert~0_111 1) (= (select .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85|) 0) (= v_~queue2~0.base_85 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t4~0#1.base_89|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_51| 0) (= (select |v_#length_287| 1) 2) (= (select .cse0 1) 0) (= (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1) |v_#valid_352|) (= (select |v_#valid_354| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (= v_~d2~0_57 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_64|) (= (select |v_#valid_354| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_354|, #memory_int=|v_#memory_int_245|, #length=|v_#length_287|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~back2~0=v_~back2~0_134, #NULL.offset=|v_#NULL.offset_20|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_61|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_26|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_56|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_71|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_35|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_43|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_56|, ~queue2~0.base=v_~queue2~0.base_85, #length=|v_#length_285|, ~front1~0=v_~front1~0_96, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_89|, ~queue2~0.offset=v_~queue2~0.offset_85, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_61|, ~back1~0=v_~back1~0_114, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_69|, ~v_assert~0=v_~v_assert~0_111, #StackHeapBarrier=|v_#StackHeapBarrier_64|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_71|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_31|, ~front2~0=v_~front2~0_100, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|, ~n1~0=v_~n1~0_102, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_77|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_85|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_25|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_69|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_51|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_47|, ~W~0=v_~W~0_87, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39|, ~queue1~0.base=v_~queue1~0.base_75, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|, ~d2~0=v_~d2~0_57, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_43|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_52|, ~n2~0=v_~n2~0_100, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_59|, #NULL.base=|v_#NULL.base_20|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_54|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_49|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_67|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_41|, #valid=|v_#valid_352|, #memory_int=|v_#memory_int_245|, ~queue1~0.offset=v_~queue1~0.offset_75, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_77|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_23|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|, ~d1~0=v_~d1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_~#t2~0#1.offset, ~back2~0, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_main_#t~nondet13#1, ~queue2~0.base, #length, ~front1~0, ULTIMATE.start_main_~#t4~0#1.base, ~queue2~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ~back1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~front2~0, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~n1~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ~W~0, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~d2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~nondet10#1, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, #valid, ~queue1~0.offset, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~d1~0] 31983#[L160-6]don't care [921] L160-6-->L160-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1))) (and (= (select |v_#valid_224| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| |v_ULTIMATE.start_create_fresh_int_array_~size#1_67|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1 4) (select |v_#length_179| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 1)) (= (store |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|)) |v_#memory_int_177|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_178|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_37|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_177|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 31985#[L160-6]don't care [967] L160-6-->L160-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~n2~0_86) (= (store |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1) |v_#valid_326|) (= (store |v_#length_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4)) |v_#length_265|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_56|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= v_~queue1~0.offset_65 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|) (= (select |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102| |v_ULTIMATE.start_create_fresh_int_array_~size#1_112|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue1~0.base_65) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102|, #valid=|v_#valid_327|, #length=|v_#length_266|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_112|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_55|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_111|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_63|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ~queue1~0.base=v_~queue1~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_63|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_61|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|, #valid=|v_#valid_326|, #length=|v_#length_265|, ~queue1~0.offset=v_~queue1~0.offset_65, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ~queue1~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 31987#[L160-14]don't care [943] L160-14-->L160-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|))) (and (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63| 4) (select |v_#length_219| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| |v_ULTIMATE.start_create_fresh_int_array_~size#1_85|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 1)) (= (store |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63| (store (select |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|)) |v_#memory_int_207|) (= (select |v_#valid_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_208|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_43|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_207|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 32305#[L160-14]don't care [973] L160-14-->L140-3: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~queue2~0.base_Out_2) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= 0 v_~W~0_In_1) 1 0)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~queue2~0.offset_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|)) |v_#memory_int_Out_2|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ~queue2~0.base=v_~queue2~0.base_Out_2, #length=|v_#length_In_3|, ~queue2~0.offset=v_~queue2~0.offset_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~queue2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~pre17#1, ~queue2~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 32303#[L140-3]don't care [729] L140-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 32301#[thread1ENTRY, L140-4]don't care [926] L140-4-->L141-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_185| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= |v_#pthreadsForks_91| (+ |v_#pthreadsForks_92| 1)) (= (select |v_#valid_230| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (= |v_ULTIMATE.start_main_#t~pre19#1_17| |v_#pthreadsForks_92|) (= (store |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre19#1_17|)) |v_#memory_int_187|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_92|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_230|, #memory_int=|v_#memory_int_188|, #length=|v_#length_185|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_91|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_230|, #memory_int=|v_#memory_int_187|, #length=|v_#length_185|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_17|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] 32299#[thread1ENTRY, L141-3]don't care [735] L141-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_2) (= |v_ULTIMATE.start_main_#t~pre19#1_6| v_thread2Thread1of1ForFork2_thidvar0_2) (= 0 v_thread2Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_10|, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_10|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_4|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_4|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_4|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_4|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_2, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_4|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~temp~0#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_#t~post7#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_thidvar2, thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_#t~mem4#1] 32297#[thread1ENTRY, L141-4, thread2ENTRY]don't care [796] thread2ENTRY-->L86: Formula: (= |v_thread2Thread1of1ForFork2_~cond~1#1_11| v_~v_assert~0_14) InVars {~v_assert~0=v_~v_assert~0_14} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_11|, ~v_assert~0=v_~v_assert~0_14, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~temp~0#1] 32001#[thread1ENTRY, L141-4, L86]don't care [2022-07-22 12:25:30,823 INFO L750 eck$LassoCheckResult]: Loop: 32001#[thread1ENTRY, L141-4, L86]don't care [838] L86-->L75: Formula: (let ((.cse1 (* v_~front1~0_43 4))) (let ((.cse0 (+ v_~queue1~0.offset_33 .cse1))) (and (= (+ v_~front1~0_43 1) v_~front1~0_42) (= (select (select |v_#memory_int_107| v_~queue1~0.base_33) .cse0) |v_thread2Thread1of1ForFork2_~temp~0#1_21|) (<= (+ v_~queue1~0.offset_33 .cse1 4) (select |v_#length_119| v_~queue1~0.base_33)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|) (= (ite (and (<= 0 v_~front1~0_43) (< v_~front1~0_43 v_~n1~0_34) (< v_~front1~0_43 v_~back1~0_56)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_15| 256) 0)) (= (select |v_#valid_142| v_~queue1~0.base_33) 1) (<= 0 .cse0)))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, ~queue1~0.base=v_~queue1~0.base_33, ~n1~0=v_~n1~0_34, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~back1~0=v_~back1~0_56, ~front1~0=v_~front1~0_43, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_21|, ~n1~0=v_~n1~0_34, ~back1~0=v_~back1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, ~queue1~0.base=v_~queue1~0.base_33, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_7|, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~front1~0=v_~front1~0_42, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~temp~0#1, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem4#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~front1~0] 29283#[thread1ENTRY, L141-4, L75]don't care [768] L75-->L83: Formula: (let ((.cse1 (* 4 v_~back2~0_53))) (let ((.cse0 (+ v_~queue2~0.offset_31 .cse1))) (and (not (= (ite (and (< v_~back2~0_53 v_~n2~0_28) (<= 0 v_~back2~0_53)) 1 0) 0)) (= (select |v_#valid_98| v_~queue2~0.base_31) 1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (+ v_~back2~0_53 1) v_~back2~0_52) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (= (+ |v_thread2Thread1of1ForFork2_~temp~0#1_13| 1) (select (select |v_#memory_int_77| v_~queue2~0.base_31) .cse0)) 1 0)) (= v_~d1~0_4 (+ v_~d1~0_5 |v_thread2Thread1of1ForFork2_~temp~0#1_13|)) (<= (+ v_~queue2~0.offset_31 .cse1 4) (select |v_#length_85| v_~queue2~0.base_31))))) InVars {thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, #valid=|v_#valid_98|, ~back2~0=v_~back2~0_53, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_5} OutVars{thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_7|, ~back2~0=v_~back2~0_52, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem6#1, ~back2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~d1~0] 29285#[thread1ENTRY, L141-4, L83]don't care [713] L83-->L86: Formula: (= v_~v_assert~0_2 |v_thread2Thread1of1ForFork2_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_7|, ~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1] 32001#[thread1ENTRY, L141-4, L86]don't care [2022-07-22 12:25:30,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:30,823 INFO L85 PathProgramCache]: Analyzing trace with hash -666112386, now seen corresponding path program 1 times [2022-07-22 12:25:30,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:30,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955427537] [2022-07-22 12:25:30,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:30,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:30,864 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:30,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:30,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:30,893 INFO L85 PathProgramCache]: Analyzing trace with hash 859630, now seen corresponding path program 2 times [2022-07-22 12:25:30,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:30,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776399086] [2022-07-22 12:25:30,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:30,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:30,907 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:30,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:30,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:30,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1404353967, now seen corresponding path program 1 times [2022-07-22 12:25:30,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:30,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215804511] [2022-07-22 12:25:30,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:30,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:31,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 12:25:31,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:25:31,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215804511] [2022-07-22 12:25:31,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215804511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:25:31,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:25:31,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:25:31,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826244091] [2022-07-22 12:25:31,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:25:31,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:25:31,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:25:31,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:25:31,290 INFO L87 Difference]: Start difference. First operand 2079 states and 9355 transitions. cyclomatic complexity: 7630 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:25:31,436 INFO L93 Difference]: Finished difference Result 2571 states and 10860 transitions. [2022-07-22 12:25:31,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2571 states and 10860 transitions. [2022-07-22 12:25:31,472 INFO L131 ngComponentsAnalysis]: Automaton has 264 accepting balls. 924 [2022-07-22 12:25:31,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2571 states to 2515 states and 10680 transitions. [2022-07-22 12:25:31,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1372 [2022-07-22 12:25:31,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1372 [2022-07-22 12:25:31,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2515 states and 10680 transitions. [2022-07-22 12:25:31,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:25:31,517 INFO L220 hiAutomatonCegarLoop]: Abstraction has 2515 states and 10680 transitions. [2022-07-22 12:25:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states and 10680 transitions. [2022-07-22 12:25:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2082. [2022-07-22 12:25:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2082 states, 2082 states have (on average 4.460614793467819) internal successors, (9287), 2081 states have internal predecessors, (9287), 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:25:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 9287 transitions. [2022-07-22 12:25:31,618 INFO L242 hiAutomatonCegarLoop]: Abstraction has 2082 states and 9287 transitions. [2022-07-22 12:25:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:25:31,620 INFO L425 stractBuchiCegarLoop]: Abstraction has 2082 states and 9287 transitions. [2022-07-22 12:25:31,620 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 12:25:31,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2082 states and 9287 transitions. [2022-07-22 12:25:31,637 INFO L131 ngComponentsAnalysis]: Automaton has 182 accepting balls. 678 [2022-07-22 12:25:31,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:31,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:31,638 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:31,639 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:25:31,640 INFO L748 eck$LassoCheckResult]: Stem: 38548#[ULTIMATE.startENTRY]don't care [977] ULTIMATE.startENTRY-->L160-6: Formula: (let ((.cse2 (store |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 1))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85| 1))) (let ((.cse0 (select |v_#memory_int_245| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= (ite (< v_~W~0_87 1073741823) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_77| 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|) (< 0 |v_#StackHeapBarrier_64|) (= v_~queue1~0.offset_75 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|) (= v_~queue2~0.offset_85 0) (= (select |v_#valid_354| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205| 0)) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_77|) (= (store (store (store (store (store |v_#length_287| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_89| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_285|) (= |v_#NULL.offset_20| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| v_~n1~0_102) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_51| 0) (= (select |v_#length_287| 2) 24) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t3~0#1.base_85|) (= (select .cse0 0) 48) (= (select |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= v_~d1~0_58 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|) (= v_~back1~0_114 v_~front1~0_96) (= v_~queue1~0.base_75 0) (= v_~front2~0_100 v_~back2~0_134) (= |v_#NULL.base_20| 0) (= v_~v_assert~0_111 1) (= (select .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85|) 0) (= v_~queue2~0.base_85 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t4~0#1.base_89|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_51| 0) (= (select |v_#length_287| 1) 2) (= (select .cse0 1) 0) (= (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1) |v_#valid_352|) (= (select |v_#valid_354| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (= v_~d2~0_57 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_64|) (= (select |v_#valid_354| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_354|, #memory_int=|v_#memory_int_245|, #length=|v_#length_287|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~back2~0=v_~back2~0_134, #NULL.offset=|v_#NULL.offset_20|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_61|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_26|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_56|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_71|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_35|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_43|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_56|, ~queue2~0.base=v_~queue2~0.base_85, #length=|v_#length_285|, ~front1~0=v_~front1~0_96, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_89|, ~queue2~0.offset=v_~queue2~0.offset_85, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_61|, ~back1~0=v_~back1~0_114, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_69|, ~v_assert~0=v_~v_assert~0_111, #StackHeapBarrier=|v_#StackHeapBarrier_64|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_71|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_31|, ~front2~0=v_~front2~0_100, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|, ~n1~0=v_~n1~0_102, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_77|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_85|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_25|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_69|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_51|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_47|, ~W~0=v_~W~0_87, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39|, ~queue1~0.base=v_~queue1~0.base_75, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|, ~d2~0=v_~d2~0_57, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_43|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_52|, ~n2~0=v_~n2~0_100, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_59|, #NULL.base=|v_#NULL.base_20|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_54|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_49|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_67|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_41|, #valid=|v_#valid_352|, #memory_int=|v_#memory_int_245|, ~queue1~0.offset=v_~queue1~0.offset_75, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_77|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_23|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|, ~d1~0=v_~d1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_~#t2~0#1.offset, ~back2~0, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_main_#t~nondet13#1, ~queue2~0.base, #length, ~front1~0, ULTIMATE.start_main_~#t4~0#1.base, ~queue2~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ~back1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~front2~0, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~n1~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ~W~0, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~d2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~nondet10#1, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, #valid, ~queue1~0.offset, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~d1~0] 38358#[L160-6]don't care [967] L160-6-->L160-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~n2~0_86) (= (store |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1) |v_#valid_326|) (= (store |v_#length_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4)) |v_#length_265|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_56|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= v_~queue1~0.offset_65 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|) (= (select |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102| |v_ULTIMATE.start_create_fresh_int_array_~size#1_112|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue1~0.base_65) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102|, #valid=|v_#valid_327|, #length=|v_#length_266|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_112|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_55|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_111|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_63|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ~queue1~0.base=v_~queue1~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_63|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_61|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|, #valid=|v_#valid_326|, #length=|v_#length_265|, ~queue1~0.offset=v_~queue1~0.offset_65, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ~queue1~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 37892#[L160-14]don't care [943] L160-14-->L160-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|))) (and (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63| 4) (select |v_#length_219| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| |v_ULTIMATE.start_create_fresh_int_array_~size#1_85|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 1)) (= (store |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63| (store (select |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|)) |v_#memory_int_207|) (= (select |v_#valid_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_208|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_43|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_207|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 37894#[L160-14]don't care [973] L160-14-->L140-3: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~queue2~0.base_Out_2) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= 0 v_~W~0_In_1) 1 0)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~queue2~0.offset_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|)) |v_#memory_int_Out_2|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ~queue2~0.base=v_~queue2~0.base_Out_2, #length=|v_#length_In_3|, ~queue2~0.offset=v_~queue2~0.offset_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~queue2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~pre17#1, ~queue2~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 36952#[L140-3]don't care [729] L140-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 36954#[thread1ENTRY, L140-4]don't care [926] L140-4-->L141-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_185| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= |v_#pthreadsForks_91| (+ |v_#pthreadsForks_92| 1)) (= (select |v_#valid_230| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (= |v_ULTIMATE.start_main_#t~pre19#1_17| |v_#pthreadsForks_92|) (= (store |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre19#1_17|)) |v_#memory_int_187|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_92|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_230|, #memory_int=|v_#memory_int_188|, #length=|v_#length_185|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_91|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_230|, #memory_int=|v_#memory_int_187|, #length=|v_#length_185|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_17|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] 37362#[thread1ENTRY, L141-3]don't care [735] L141-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_2) (= |v_ULTIMATE.start_main_#t~pre19#1_6| v_thread2Thread1of1ForFork2_thidvar0_2) (= 0 v_thread2Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_10|, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_10|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_4|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_4|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_4|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_4|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_2, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_4|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~temp~0#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_#t~post7#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_thidvar2, thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_#t~mem4#1] 37364#[thread1ENTRY, L141-4, thread2ENTRY]don't care [922] L141-4-->L142-3: Formula: (and (= (store |v_#memory_int_182| |v_ULTIMATE.start_main_~#t3~0#1.base_41| (store (select |v_#memory_int_182| |v_ULTIMATE.start_main_~#t3~0#1.base_41|) |v_ULTIMATE.start_main_~#t3~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre21#1_35|)) |v_#memory_int_181|) (<= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_39|) (= |v_#pthreadsForks_88| |v_ULTIMATE.start_main_#t~pre21#1_35|) (= (select |v_#valid_226| |v_ULTIMATE.start_main_~#t3~0#1.base_41|) 1) (= |v_#pthreadsForks_87| (+ |v_#pthreadsForks_88| 1)) (<= (+ |v_ULTIMATE.start_main_~#t3~0#1.offset_39| 4) (select |v_#length_181| |v_ULTIMATE.start_main_~#t3~0#1.base_41|))) InVars {#pthreadsForks=|v_#pthreadsForks_88|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_39|, #valid=|v_#valid_226|, #memory_int=|v_#memory_int_182|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|, #length=|v_#length_181|} OutVars{#pthreadsForks=|v_#pthreadsForks_87|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_39|, #valid=|v_#valid_226|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_15|, #memory_int=|v_#memory_int_181|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_35|, #length=|v_#length_181|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_15|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet20#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~pre19#1] 36004#[thread1ENTRY, L142-3, thread2ENTRY]don't care [738] L142-3-->thread3ENTRY: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar0_2 |v_ULTIMATE.start_main_#t~pre21#1_6|) (= v_thread3Thread1of1ForFork3_thidvar1_2 0) (= v_thread3Thread1of1ForFork3_thidvar3_2 0) (= v_thread3Thread1of1ForFork3_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_6|} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2, thread3Thread1of1ForFork3_thidvar3=v_thread3Thread1of1ForFork3_thidvar3_2, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_6|, thread3Thread1of1ForFork3_#res#1.offset=|v_thread3Thread1of1ForFork3_#res#1.offset_4|, thread3Thread1of1ForFork3_~temp~1#1=|v_thread3Thread1of1ForFork3_~temp~1#1_8|, thread3Thread1of1ForFork3_#res#1.base=|v_thread3Thread1of1ForFork3_#res#1.base_4|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_10|, thread3Thread1of1ForFork3_#t~mem8#1=|v_thread3Thread1of1ForFork3_#t~mem8#1_4|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_4|, thread3Thread1of1ForFork3_#t~post9#1=|v_thread3Thread1of1ForFork3_#t~post9#1_4|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1, thread3Thread1of1ForFork3_#res#1.offset, thread3Thread1of1ForFork3_~temp~1#1, thread3Thread1of1ForFork3_thidvar3, thread3Thread1of1ForFork3_#res#1.base, thread3Thread1of1ForFork3_~cond~2#1, thread3Thread1of1ForFork3_#t~mem8#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post9#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1] 36008#[thread2ENTRY, thread3ENTRY, thread1ENTRY, L142-4]don't care [757] thread3ENTRY-->L108: Formula: (= |v_thread3Thread1of1ForFork3_~cond~2#1_11| v_~v_assert~0_10) InVars {~v_assert~0=v_~v_assert~0_10} OutVars{~v_assert~0=v_~v_assert~0_10, thread3Thread1of1ForFork3_~temp~1#1=|v_thread3Thread1of1ForFork3_~temp~1#1_9|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_11|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_~temp~1#1, thread3Thread1of1ForFork3_~cond~2#1] 35952#[thread2ENTRY, L108, thread1ENTRY, L142-4]don't care [2022-07-22 12:25:31,640 INFO L750 eck$LassoCheckResult]: Loop: 35952#[thread2ENTRY, L108, thread1ENTRY, L142-4]don't care [813] L108-->L102: Formula: (let ((.cse1 (* v_~front2~0_59 4))) (let ((.cse0 (+ v_~queue2~0.offset_37 .cse1))) (and (= (select |v_#valid_128| v_~queue2~0.base_37) 1) (= (select (select |v_#memory_int_99| v_~queue2~0.base_37) .cse0) |v_thread3Thread1of1ForFork3_~temp~1#1_21|) (= (ite (and (< v_~front2~0_59 v_~n2~0_36) (< v_~front2~0_59 v_~back2~0_66) (<= 0 v_~front2~0_59)) 1 0) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_11|) (not (= (mod |v_thread3Thread1of1ForFork3_~cond~2#1_15| 256) 0)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_11|) (= (+ v_~front2~0_59 1) v_~front2~0_58) (<= 0 .cse0) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_11| 0)) (<= (+ v_~queue2~0.offset_37 .cse1 4) (select |v_#length_113| v_~queue2~0.base_37))))) InVars {~n2~0=v_~n2~0_36, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_15|, #valid=|v_#valid_128|, ~back2~0=v_~back2~0_66, #memory_int=|v_#memory_int_99|, ~queue2~0.base=v_~queue2~0.base_37, #length=|v_#length_113|, ~front2~0=v_~front2~0_59, ~queue2~0.offset=v_~queue2~0.offset_37} OutVars{~n2~0=v_~n2~0_36, ~back2~0=v_~back2~0_66, thread3Thread1of1ForFork3_~temp~1#1=|v_thread3Thread1of1ForFork3_~temp~1#1_21|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_15|, #valid=|v_#valid_128|, thread3Thread1of1ForFork3_#t~mem8#1=|v_thread3Thread1of1ForFork3_#t~mem8#1_11|, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_11|, ~queue2~0.base=v_~queue2~0.base_37, #length=|v_#length_113|, ~front2~0=v_~front2~0_58, thread3Thread1of1ForFork3_#t~post9#1=|v_thread3Thread1of1ForFork3_#t~post9#1_11|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_11|, ~queue2~0.offset=v_~queue2~0.offset_37} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_~temp~1#1, thread3Thread1of1ForFork3_#t~mem8#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~front2~0, thread3Thread1of1ForFork3_#t~post9#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1] 35960#[L102, thread2ENTRY, thread1ENTRY, L142-4]don't care [722] L102-->L105: Formula: (= (+ v_~d2~0_2 |v_thread3Thread1of1ForFork3_~temp~1#1_5|) v_~d2~0_1) InVars {thread3Thread1of1ForFork3_~temp~1#1=|v_thread3Thread1of1ForFork3_~temp~1#1_5|, ~d2~0=v_~d2~0_2} OutVars{thread3Thread1of1ForFork3_~temp~1#1=|v_thread3Thread1of1ForFork3_~temp~1#1_5|, ~d2~0=v_~d2~0_1} AuxVars[] AssignedVars[~d2~0] 36628#[thread2ENTRY, L105, thread1ENTRY, L142-4]don't care [723] L105-->L108: Formula: (= v_~v_assert~0_4 |v_thread3Thread1of1ForFork3_~cond~2#1_7|) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_~cond~2#1] 35952#[thread2ENTRY, L108, thread1ENTRY, L142-4]don't care [2022-07-22 12:25:31,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1249765912, now seen corresponding path program 1 times [2022-07-22 12:25:31,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:31,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207822859] [2022-07-22 12:25:31,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:31,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:31,670 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:31,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:31,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:31,709 INFO L85 PathProgramCache]: Analyzing trace with hash 834189, now seen corresponding path program 1 times [2022-07-22 12:25:31,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:31,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840364391] [2022-07-22 12:25:31,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:31,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:31,716 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:31,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:31,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:31,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1296009030, now seen corresponding path program 1 times [2022-07-22 12:25:31,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:31,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061474016] [2022-07-22 12:25:31,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:31,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:31,797 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:25:31,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:25:31,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061474016] [2022-07-22 12:25:31,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061474016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:25:31,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:25:31,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:25:31,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329830252] [2022-07-22 12:25:31,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:25:31,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:25:31,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:25:31,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:25:31,911 INFO L87 Difference]: Start difference. First operand 2082 states and 9287 transitions. cyclomatic complexity: 7555 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:32,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:25:32,026 INFO L93 Difference]: Finished difference Result 2260 states and 9943 transitions. [2022-07-22 12:25:32,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2260 states and 9943 transitions. [2022-07-22 12:25:32,064 INFO L131 ngComponentsAnalysis]: Automaton has 98 accepting balls. 426 [2022-07-22 12:25:32,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2260 states to 1951 states and 8807 transitions. [2022-07-22 12:25:32,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 869 [2022-07-22 12:25:32,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 869 [2022-07-22 12:25:32,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1951 states and 8807 transitions. [2022-07-22 12:25:32,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:25:32,107 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1951 states and 8807 transitions. [2022-07-22 12:25:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states and 8807 transitions. [2022-07-22 12:25:32,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1835. [2022-07-22 12:25:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1835 states have (on average 4.566212534059946) internal successors, (8379), 1834 states have internal predecessors, (8379), 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:25:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 8379 transitions. [2022-07-22 12:25:32,191 INFO L242 hiAutomatonCegarLoop]: Abstraction has 1835 states and 8379 transitions. [2022-07-22 12:25:32,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:25:32,194 INFO L425 stractBuchiCegarLoop]: Abstraction has 1835 states and 8379 transitions. [2022-07-22 12:25:32,194 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 12:25:32,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1835 states and 8379 transitions. [2022-07-22 12:25:32,213 INFO L131 ngComponentsAnalysis]: Automaton has 98 accepting balls. 426 [2022-07-22 12:25:32,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:32,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:32,216 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:32,216 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:25:32,219 INFO L748 eck$LassoCheckResult]: Stem: 44545#[ULTIMATE.startENTRY]don't care [977] ULTIMATE.startENTRY-->L160-6: Formula: (let ((.cse2 (store |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 1))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85| 1))) (let ((.cse0 (select |v_#memory_int_245| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= (ite (< v_~W~0_87 1073741823) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_77| 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|) (< 0 |v_#StackHeapBarrier_64|) (= v_~queue1~0.offset_75 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|) (= v_~queue2~0.offset_85 0) (= (select |v_#valid_354| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205| 0)) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_77|) (= (store (store (store (store (store |v_#length_287| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_89| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_285|) (= |v_#NULL.offset_20| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| v_~n1~0_102) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_51| 0) (= (select |v_#length_287| 2) 24) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t3~0#1.base_85|) (= (select .cse0 0) 48) (= (select |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= v_~d1~0_58 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|) (= v_~back1~0_114 v_~front1~0_96) (= v_~queue1~0.base_75 0) (= v_~front2~0_100 v_~back2~0_134) (= |v_#NULL.base_20| 0) (= v_~v_assert~0_111 1) (= (select .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85|) 0) (= v_~queue2~0.base_85 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t4~0#1.base_89|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_51| 0) (= (select |v_#length_287| 1) 2) (= (select .cse0 1) 0) (= (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1) |v_#valid_352|) (= (select |v_#valid_354| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (= v_~d2~0_57 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_64|) (= (select |v_#valid_354| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_354|, #memory_int=|v_#memory_int_245|, #length=|v_#length_287|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~back2~0=v_~back2~0_134, #NULL.offset=|v_#NULL.offset_20|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_61|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_26|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_56|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_71|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_35|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_43|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_56|, ~queue2~0.base=v_~queue2~0.base_85, #length=|v_#length_285|, ~front1~0=v_~front1~0_96, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_89|, ~queue2~0.offset=v_~queue2~0.offset_85, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_61|, ~back1~0=v_~back1~0_114, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_69|, ~v_assert~0=v_~v_assert~0_111, #StackHeapBarrier=|v_#StackHeapBarrier_64|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_71|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_31|, ~front2~0=v_~front2~0_100, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|, ~n1~0=v_~n1~0_102, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_77|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_85|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_25|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_69|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_51|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_47|, ~W~0=v_~W~0_87, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39|, ~queue1~0.base=v_~queue1~0.base_75, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|, ~d2~0=v_~d2~0_57, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_43|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_52|, ~n2~0=v_~n2~0_100, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_59|, #NULL.base=|v_#NULL.base_20|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_54|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_49|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_67|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_41|, #valid=|v_#valid_352|, #memory_int=|v_#memory_int_245|, ~queue1~0.offset=v_~queue1~0.offset_75, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_77|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_23|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|, ~d1~0=v_~d1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_~#t2~0#1.offset, ~back2~0, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_main_#t~nondet13#1, ~queue2~0.base, #length, ~front1~0, ULTIMATE.start_main_~#t4~0#1.base, ~queue2~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ~back1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~front2~0, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~n1~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ~W~0, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~d2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~nondet10#1, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, #valid, ~queue1~0.offset, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~d1~0] 44377#[L160-6]don't care [921] L160-6-->L160-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1))) (and (= (select |v_#valid_224| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| |v_ULTIMATE.start_create_fresh_int_array_~size#1_67|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1 4) (select |v_#length_179| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 1)) (= (store |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|)) |v_#memory_int_177|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_178|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_37|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_177|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 44379#[L160-6]don't care [967] L160-6-->L160-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~n2~0_86) (= (store |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1) |v_#valid_326|) (= (store |v_#length_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4)) |v_#length_265|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_56|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= v_~queue1~0.offset_65 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|) (= (select |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102| |v_ULTIMATE.start_create_fresh_int_array_~size#1_112|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue1~0.base_65) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102|, #valid=|v_#valid_327|, #length=|v_#length_266|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_112|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_55|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_111|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_63|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ~queue1~0.base=v_~queue1~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_63|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_61|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|, #valid=|v_#valid_326|, #length=|v_#length_265|, ~queue1~0.offset=v_~queue1~0.offset_65, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ~queue1~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 43915#[L160-14]don't care [943] L160-14-->L160-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|))) (and (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63| 4) (select |v_#length_219| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| |v_ULTIMATE.start_create_fresh_int_array_~size#1_85|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 1)) (= (store |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63| (store (select |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|)) |v_#memory_int_207|) (= (select |v_#valid_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_208|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_43|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_207|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 43917#[L160-14]don't care [973] L160-14-->L140-3: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~queue2~0.base_Out_2) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= 0 v_~W~0_In_1) 1 0)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~queue2~0.offset_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|)) |v_#memory_int_Out_2|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ~queue2~0.base=v_~queue2~0.base_Out_2, #length=|v_#length_In_3|, ~queue2~0.offset=v_~queue2~0.offset_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~queue2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~pre17#1, ~queue2~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 43091#[L140-3]don't care [729] L140-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 43093#[thread1ENTRY, L140-4]don't care [690] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 43685#[L48-4, L140-4]don't care [876] L48-4-->L55: Formula: (and (= v_~v_assert~0_40 |v_thread1Thread1of1ForFork0_~cond~0#1_17|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_17| 256) 0)) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_33|)) InVars {~v_assert~0=v_~v_assert~0_40, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_33|} OutVars{~v_assert~0=v_~v_assert~0_40, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_33|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_17|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 44251#[L55, L140-4]don't care [849] L55-->L48-4: Formula: (let ((.cse0 (* 4 v_~back1~0_65))) (let ((.cse1 (+ v_~queue1~0.offset_37 .cse0))) (and (<= (+ v_~queue1~0.offset_37 .cse0 4) (select |v_#length_125| v_~queue1~0.base_37)) (= v_~back1~0_64 (+ v_~back1~0_65 1)) (<= 0 .cse1) (= (ite (= (select (select |v_#memory_int_115| v_~queue1~0.base_37) .cse1) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_23| 1) |v_thread1Thread1of1ForFork0_~w~0#1_24|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_148| v_~queue1~0.base_37) 1) (not (= (ite (and (<= 0 v_~back1~0_65) (< v_~back1~0_65 v_~n1~0_38)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~queue1~0.base=v_~queue1~0.base_37, ~n1~0=v_~n1~0_38, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_115|, ~back1~0=v_~back1~0_65, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_24|, ~queue1~0.offset=v_~queue1~0.offset_37, #length=|v_#length_125|} OutVars{~n1~0=v_~n1~0_38, ~back1~0=v_~back1~0_64, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_11|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_17|, ~queue1~0.base=v_~queue1~0.base_37, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_11|, #valid=|v_#valid_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_115|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_23|, ~queue1~0.offset=v_~queue1~0.offset_37, #length=|v_#length_125|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~back1~0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 44253#[L48-4, L140-4]don't care [926] L140-4-->L141-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_185| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= |v_#pthreadsForks_91| (+ |v_#pthreadsForks_92| 1)) (= (select |v_#valid_230| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (= |v_ULTIMATE.start_main_#t~pre19#1_17| |v_#pthreadsForks_92|) (= (store |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre19#1_17|)) |v_#memory_int_187|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_92|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_230|, #memory_int=|v_#memory_int_188|, #length=|v_#length_185|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_91|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_230|, #memory_int=|v_#memory_int_187|, #length=|v_#length_185|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_17|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] 44471#[L48-4, L141-3]don't care [735] L141-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_2) (= |v_ULTIMATE.start_main_#t~pre19#1_6| v_thread2Thread1of1ForFork2_thidvar0_2) (= 0 v_thread2Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_10|, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_10|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_4|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_4|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_4|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_4|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_2, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_4|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~temp~0#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_#t~post7#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_thidvar2, thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_#t~mem4#1] 44349#[L141-4, L48-4, thread2ENTRY]don't care [796] thread2ENTRY-->L86: Formula: (= |v_thread2Thread1of1ForFork2_~cond~1#1_11| v_~v_assert~0_14) InVars {~v_assert~0=v_~v_assert~0_14} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_11|, ~v_assert~0=v_~v_assert~0_14, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~temp~0#1] 44355#[L141-4, L48-4, L86]don't care [838] L86-->L75: Formula: (let ((.cse1 (* v_~front1~0_43 4))) (let ((.cse0 (+ v_~queue1~0.offset_33 .cse1))) (and (= (+ v_~front1~0_43 1) v_~front1~0_42) (= (select (select |v_#memory_int_107| v_~queue1~0.base_33) .cse0) |v_thread2Thread1of1ForFork2_~temp~0#1_21|) (<= (+ v_~queue1~0.offset_33 .cse1 4) (select |v_#length_119| v_~queue1~0.base_33)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|) (= (ite (and (<= 0 v_~front1~0_43) (< v_~front1~0_43 v_~n1~0_34) (< v_~front1~0_43 v_~back1~0_56)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_15| 256) 0)) (= (select |v_#valid_142| v_~queue1~0.base_33) 1) (<= 0 .cse0)))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, ~queue1~0.base=v_~queue1~0.base_33, ~n1~0=v_~n1~0_34, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~back1~0=v_~back1~0_56, ~front1~0=v_~front1~0_43, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_21|, ~n1~0=v_~n1~0_34, ~back1~0=v_~back1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, ~queue1~0.base=v_~queue1~0.base_33, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_7|, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~front1~0=v_~front1~0_42, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~temp~0#1, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem4#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~front1~0] 44911#[L75, L141-4, L48-4]don't care [768] L75-->L83: Formula: (let ((.cse1 (* 4 v_~back2~0_53))) (let ((.cse0 (+ v_~queue2~0.offset_31 .cse1))) (and (not (= (ite (and (< v_~back2~0_53 v_~n2~0_28) (<= 0 v_~back2~0_53)) 1 0) 0)) (= (select |v_#valid_98| v_~queue2~0.base_31) 1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (+ v_~back2~0_53 1) v_~back2~0_52) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (= (+ |v_thread2Thread1of1ForFork2_~temp~0#1_13| 1) (select (select |v_#memory_int_77| v_~queue2~0.base_31) .cse0)) 1 0)) (= v_~d1~0_4 (+ v_~d1~0_5 |v_thread2Thread1of1ForFork2_~temp~0#1_13|)) (<= (+ v_~queue2~0.offset_31 .cse1 4) (select |v_#length_85| v_~queue2~0.base_31))))) InVars {thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, #valid=|v_#valid_98|, ~back2~0=v_~back2~0_53, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_5} OutVars{thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_7|, ~back2~0=v_~back2~0_52, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem6#1, ~back2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~d1~0] 44909#[L141-4, L48-4, L83]don't care [2022-07-22 12:25:32,219 INFO L750 eck$LassoCheckResult]: Loop: 44909#[L141-4, L48-4, L83]don't care [713] L83-->L86: Formula: (= v_~v_assert~0_2 |v_thread2Thread1of1ForFork2_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_7|, ~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1] 44907#[L141-4, L48-4, L86]don't care [838] L86-->L75: Formula: (let ((.cse1 (* v_~front1~0_43 4))) (let ((.cse0 (+ v_~queue1~0.offset_33 .cse1))) (and (= (+ v_~front1~0_43 1) v_~front1~0_42) (= (select (select |v_#memory_int_107| v_~queue1~0.base_33) .cse0) |v_thread2Thread1of1ForFork2_~temp~0#1_21|) (<= (+ v_~queue1~0.offset_33 .cse1 4) (select |v_#length_119| v_~queue1~0.base_33)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|) (= (ite (and (<= 0 v_~front1~0_43) (< v_~front1~0_43 v_~n1~0_34) (< v_~front1~0_43 v_~back1~0_56)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_15| 256) 0)) (= (select |v_#valid_142| v_~queue1~0.base_33) 1) (<= 0 .cse0)))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, ~queue1~0.base=v_~queue1~0.base_33, ~n1~0=v_~n1~0_34, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~back1~0=v_~back1~0_56, ~front1~0=v_~front1~0_43, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_21|, ~n1~0=v_~n1~0_34, ~back1~0=v_~back1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, ~queue1~0.base=v_~queue1~0.base_33, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_7|, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~front1~0=v_~front1~0_42, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~temp~0#1, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem4#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~front1~0] 45137#[L75, L141-4, L48-4]don't care [768] L75-->L83: Formula: (let ((.cse1 (* 4 v_~back2~0_53))) (let ((.cse0 (+ v_~queue2~0.offset_31 .cse1))) (and (not (= (ite (and (< v_~back2~0_53 v_~n2~0_28) (<= 0 v_~back2~0_53)) 1 0) 0)) (= (select |v_#valid_98| v_~queue2~0.base_31) 1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (+ v_~back2~0_53 1) v_~back2~0_52) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (= (+ |v_thread2Thread1of1ForFork2_~temp~0#1_13| 1) (select (select |v_#memory_int_77| v_~queue2~0.base_31) .cse0)) 1 0)) (= v_~d1~0_4 (+ v_~d1~0_5 |v_thread2Thread1of1ForFork2_~temp~0#1_13|)) (<= (+ v_~queue2~0.offset_31 .cse1 4) (select |v_#length_85| v_~queue2~0.base_31))))) InVars {thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, #valid=|v_#valid_98|, ~back2~0=v_~back2~0_53, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_5} OutVars{thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_7|, ~back2~0=v_~back2~0_52, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem6#1, ~back2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~d1~0] 44909#[L141-4, L48-4, L83]don't care [2022-07-22 12:25:32,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:32,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2064071589, now seen corresponding path program 1 times [2022-07-22 12:25:32,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:32,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506783694] [2022-07-22 12:25:32,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:32,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:32,344 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:32,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:32,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:32,447 INFO L85 PathProgramCache]: Analyzing trace with hash 741730, now seen corresponding path program 3 times [2022-07-22 12:25:32,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:32,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127247337] [2022-07-22 12:25:32,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:32,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:32,455 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:32,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:32,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:32,476 INFO L85 PathProgramCache]: Analyzing trace with hash 290780872, now seen corresponding path program 1 times [2022-07-22 12:25:32,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:32,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359940913] [2022-07-22 12:25:32,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:32,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:25:32,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:25:32,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359940913] [2022-07-22 12:25:32,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359940913] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:25:32,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051907349] [2022-07-22 12:25:32,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:32,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:25:32,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:32,593 INFO L229 MonitoredProcess]: Starting monitored process 124 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:25:32,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2022-07-22 12:25:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:32,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 12:25:32,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:25:32,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:25:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:25:32,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051907349] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:25:32,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:25:32,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-07-22 12:25:32,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949269034] [2022-07-22 12:25:32,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:25:33,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:25:33,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 12:25:33,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-07-22 12:25:33,046 INFO L87 Difference]: Start difference. First operand 1835 states and 8379 transitions. cyclomatic complexity: 6811 Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 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:25:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:25:33,512 INFO L93 Difference]: Finished difference Result 3783 states and 16811 transitions. [2022-07-22 12:25:33,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3783 states and 16811 transitions. [2022-07-22 12:25:33,566 INFO L131 ngComponentsAnalysis]: Automaton has 190 accepting balls. 702 [2022-07-22 12:25:33,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3783 states to 3387 states and 15009 transitions. [2022-07-22 12:25:33,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1511 [2022-07-22 12:25:33,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1511 [2022-07-22 12:25:33,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3387 states and 15009 transitions. [2022-07-22 12:25:33,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:25:33,615 INFO L220 hiAutomatonCegarLoop]: Abstraction has 3387 states and 15009 transitions. [2022-07-22 12:25:33,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states and 15009 transitions. [2022-07-22 12:25:33,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3120. [2022-07-22 12:25:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3120 states, 3120 states have (on average 4.50801282051282) internal successors, (14065), 3119 states have internal predecessors, (14065), 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:25:33,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 14065 transitions. [2022-07-22 12:25:33,739 INFO L242 hiAutomatonCegarLoop]: Abstraction has 3120 states and 14065 transitions. [2022-07-22 12:25:33,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 12:25:33,740 INFO L425 stractBuchiCegarLoop]: Abstraction has 3120 states and 14065 transitions. [2022-07-22 12:25:33,740 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 12:25:33,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3120 states and 14065 transitions. [2022-07-22 12:25:33,766 INFO L131 ngComponentsAnalysis]: Automaton has 164 accepting balls. 624 [2022-07-22 12:25:33,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:33,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:33,767 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:33,767 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:25:33,769 INFO L748 eck$LassoCheckResult]: Stem: 52158#[ULTIMATE.startENTRY]don't care [977] ULTIMATE.startENTRY-->L160-6: Formula: (let ((.cse2 (store |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 1))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85| 1))) (let ((.cse0 (select |v_#memory_int_245| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= (ite (< v_~W~0_87 1073741823) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_77| 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|) (< 0 |v_#StackHeapBarrier_64|) (= v_~queue1~0.offset_75 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|) (= v_~queue2~0.offset_85 0) (= (select |v_#valid_354| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205| 0)) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_77|) (= (store (store (store (store (store |v_#length_287| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_89| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_285|) (= |v_#NULL.offset_20| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| v_~n1~0_102) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_51| 0) (= (select |v_#length_287| 2) 24) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t3~0#1.base_85|) (= (select .cse0 0) 48) (= (select |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= v_~d1~0_58 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|) (= v_~back1~0_114 v_~front1~0_96) (= v_~queue1~0.base_75 0) (= v_~front2~0_100 v_~back2~0_134) (= |v_#NULL.base_20| 0) (= v_~v_assert~0_111 1) (= (select .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85|) 0) (= v_~queue2~0.base_85 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t4~0#1.base_89|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_51| 0) (= (select |v_#length_287| 1) 2) (= (select .cse0 1) 0) (= (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1) |v_#valid_352|) (= (select |v_#valid_354| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (= v_~d2~0_57 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_64|) (= (select |v_#valid_354| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_354|, #memory_int=|v_#memory_int_245|, #length=|v_#length_287|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~back2~0=v_~back2~0_134, #NULL.offset=|v_#NULL.offset_20|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_61|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_26|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_56|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_71|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_35|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_43|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_56|, ~queue2~0.base=v_~queue2~0.base_85, #length=|v_#length_285|, ~front1~0=v_~front1~0_96, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_89|, ~queue2~0.offset=v_~queue2~0.offset_85, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_61|, ~back1~0=v_~back1~0_114, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_69|, ~v_assert~0=v_~v_assert~0_111, #StackHeapBarrier=|v_#StackHeapBarrier_64|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_71|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_31|, ~front2~0=v_~front2~0_100, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|, ~n1~0=v_~n1~0_102, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_77|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_85|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_25|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_69|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_51|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_47|, ~W~0=v_~W~0_87, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39|, ~queue1~0.base=v_~queue1~0.base_75, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|, ~d2~0=v_~d2~0_57, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_43|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_52|, ~n2~0=v_~n2~0_100, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_59|, #NULL.base=|v_#NULL.base_20|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_54|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_49|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_67|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_41|, #valid=|v_#valid_352|, #memory_int=|v_#memory_int_245|, ~queue1~0.offset=v_~queue1~0.offset_75, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_77|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_23|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|, ~d1~0=v_~d1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_~#t2~0#1.offset, ~back2~0, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_main_#t~nondet13#1, ~queue2~0.base, #length, ~front1~0, ULTIMATE.start_main_~#t4~0#1.base, ~queue2~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ~back1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~front2~0, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~n1~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ~W~0, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~d2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~nondet10#1, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, #valid, ~queue1~0.offset, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~d1~0] 51954#[L160-6]don't care [921] L160-6-->L160-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1))) (and (= (select |v_#valid_224| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| |v_ULTIMATE.start_create_fresh_int_array_~size#1_67|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1 4) (select |v_#length_179| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 1)) (= (store |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|)) |v_#memory_int_177|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_178|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_37|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_177|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 51956#[L160-6]don't care [967] L160-6-->L160-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~n2~0_86) (= (store |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1) |v_#valid_326|) (= (store |v_#length_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4)) |v_#length_265|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_56|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= v_~queue1~0.offset_65 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|) (= (select |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102| |v_ULTIMATE.start_create_fresh_int_array_~size#1_112|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue1~0.base_65) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102|, #valid=|v_#valid_327|, #length=|v_#length_266|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_112|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_55|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_111|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_63|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ~queue1~0.base=v_~queue1~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_63|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_61|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|, #valid=|v_#valid_326|, #length=|v_#length_265|, ~queue1~0.offset=v_~queue1~0.offset_65, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ~queue1~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 51444#[L160-14]don't care [943] L160-14-->L160-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|))) (and (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63| 4) (select |v_#length_219| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| |v_ULTIMATE.start_create_fresh_int_array_~size#1_85|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 1)) (= (store |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63| (store (select |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|)) |v_#memory_int_207|) (= (select |v_#valid_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_208|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_43|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_207|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 51446#[L160-14]don't care [943] L160-14-->L160-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|))) (and (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63| 4) (select |v_#length_219| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| |v_ULTIMATE.start_create_fresh_int_array_~size#1_85|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 1)) (= (store |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63| (store (select |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|)) |v_#memory_int_207|) (= (select |v_#valid_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_208|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_43|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_207|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 51448#[L160-14]don't care [973] L160-14-->L140-3: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~queue2~0.base_Out_2) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= 0 v_~W~0_In_1) 1 0)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~queue2~0.offset_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|)) |v_#memory_int_Out_2|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ~queue2~0.base=v_~queue2~0.base_Out_2, #length=|v_#length_In_3|, ~queue2~0.offset=v_~queue2~0.offset_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~queue2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~pre17#1, ~queue2~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 53604#[L140-3]don't care [729] L140-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 53596#[thread1ENTRY, L140-4]don't care [690] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 53584#[L48-4, L140-4]don't care [876] L48-4-->L55: Formula: (and (= v_~v_assert~0_40 |v_thread1Thread1of1ForFork0_~cond~0#1_17|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_17| 256) 0)) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_33|)) InVars {~v_assert~0=v_~v_assert~0_40, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_33|} OutVars{~v_assert~0=v_~v_assert~0_40, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_33|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_17|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 53582#[L55, L140-4]don't care [849] L55-->L48-4: Formula: (let ((.cse0 (* 4 v_~back1~0_65))) (let ((.cse1 (+ v_~queue1~0.offset_37 .cse0))) (and (<= (+ v_~queue1~0.offset_37 .cse0 4) (select |v_#length_125| v_~queue1~0.base_37)) (= v_~back1~0_64 (+ v_~back1~0_65 1)) (<= 0 .cse1) (= (ite (= (select (select |v_#memory_int_115| v_~queue1~0.base_37) .cse1) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_23| 1) |v_thread1Thread1of1ForFork0_~w~0#1_24|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_148| v_~queue1~0.base_37) 1) (not (= (ite (and (<= 0 v_~back1~0_65) (< v_~back1~0_65 v_~n1~0_38)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~queue1~0.base=v_~queue1~0.base_37, ~n1~0=v_~n1~0_38, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_115|, ~back1~0=v_~back1~0_65, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_24|, ~queue1~0.offset=v_~queue1~0.offset_37, #length=|v_#length_125|} OutVars{~n1~0=v_~n1~0_38, ~back1~0=v_~back1~0_64, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_11|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_17|, ~queue1~0.base=v_~queue1~0.base_37, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_11|, #valid=|v_#valid_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_115|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_23|, ~queue1~0.offset=v_~queue1~0.offset_37, #length=|v_#length_125|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~back1~0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 51832#[L48-4, L140-4]don't care [926] L140-4-->L141-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_185| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= |v_#pthreadsForks_91| (+ |v_#pthreadsForks_92| 1)) (= (select |v_#valid_230| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (= |v_ULTIMATE.start_main_#t~pre19#1_17| |v_#pthreadsForks_92|) (= (store |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre19#1_17|)) |v_#memory_int_187|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_92|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_230|, #memory_int=|v_#memory_int_188|, #length=|v_#length_185|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_91|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_230|, #memory_int=|v_#memory_int_187|, #length=|v_#length_185|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_17|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] 52064#[L48-4, L141-3]don't care [735] L141-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_2) (= |v_ULTIMATE.start_main_#t~pre19#1_6| v_thread2Thread1of1ForFork2_thidvar0_2) (= 0 v_thread2Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_10|, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_10|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_4|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_4|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_4|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_4|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_2, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_4|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~temp~0#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_#t~post7#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_thidvar2, thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_#t~mem4#1] 53602#[L141-4, L48-4, thread2ENTRY]don't care [796] thread2ENTRY-->L86: Formula: (= |v_thread2Thread1of1ForFork2_~cond~1#1_11| v_~v_assert~0_14) InVars {~v_assert~0=v_~v_assert~0_14} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_11|, ~v_assert~0=v_~v_assert~0_14, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~temp~0#1] 53594#[L141-4, L48-4, L86]don't care [838] L86-->L75: Formula: (let ((.cse1 (* v_~front1~0_43 4))) (let ((.cse0 (+ v_~queue1~0.offset_33 .cse1))) (and (= (+ v_~front1~0_43 1) v_~front1~0_42) (= (select (select |v_#memory_int_107| v_~queue1~0.base_33) .cse0) |v_thread2Thread1of1ForFork2_~temp~0#1_21|) (<= (+ v_~queue1~0.offset_33 .cse1 4) (select |v_#length_119| v_~queue1~0.base_33)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|) (= (ite (and (<= 0 v_~front1~0_43) (< v_~front1~0_43 v_~n1~0_34) (< v_~front1~0_43 v_~back1~0_56)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_15| 256) 0)) (= (select |v_#valid_142| v_~queue1~0.base_33) 1) (<= 0 .cse0)))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, ~queue1~0.base=v_~queue1~0.base_33, ~n1~0=v_~n1~0_34, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~back1~0=v_~back1~0_56, ~front1~0=v_~front1~0_43, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_21|, ~n1~0=v_~n1~0_34, ~back1~0=v_~back1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, ~queue1~0.base=v_~queue1~0.base_33, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_7|, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~front1~0=v_~front1~0_42, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~temp~0#1, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem4#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~front1~0] 53610#[L75, L141-4, L48-4]don't care [768] L75-->L83: Formula: (let ((.cse1 (* 4 v_~back2~0_53))) (let ((.cse0 (+ v_~queue2~0.offset_31 .cse1))) (and (not (= (ite (and (< v_~back2~0_53 v_~n2~0_28) (<= 0 v_~back2~0_53)) 1 0) 0)) (= (select |v_#valid_98| v_~queue2~0.base_31) 1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (+ v_~back2~0_53 1) v_~back2~0_52) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (= (+ |v_thread2Thread1of1ForFork2_~temp~0#1_13| 1) (select (select |v_#memory_int_77| v_~queue2~0.base_31) .cse0)) 1 0)) (= v_~d1~0_4 (+ v_~d1~0_5 |v_thread2Thread1of1ForFork2_~temp~0#1_13|)) (<= (+ v_~queue2~0.offset_31 .cse1 4) (select |v_#length_85| v_~queue2~0.base_31))))) InVars {thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, #valid=|v_#valid_98|, ~back2~0=v_~back2~0_53, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_5} OutVars{thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_7|, ~back2~0=v_~back2~0_52, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem6#1, ~back2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~d1~0] 53674#[L141-4, L48-4, L83]don't care [2022-07-22 12:25:33,769 INFO L750 eck$LassoCheckResult]: Loop: 53674#[L141-4, L48-4, L83]don't care [713] L83-->L86: Formula: (= v_~v_assert~0_2 |v_thread2Thread1of1ForFork2_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_7|, ~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1] 53666#[L141-4, L48-4, L86]don't care [838] L86-->L75: Formula: (let ((.cse1 (* v_~front1~0_43 4))) (let ((.cse0 (+ v_~queue1~0.offset_33 .cse1))) (and (= (+ v_~front1~0_43 1) v_~front1~0_42) (= (select (select |v_#memory_int_107| v_~queue1~0.base_33) .cse0) |v_thread2Thread1of1ForFork2_~temp~0#1_21|) (<= (+ v_~queue1~0.offset_33 .cse1 4) (select |v_#length_119| v_~queue1~0.base_33)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|) (= (ite (and (<= 0 v_~front1~0_43) (< v_~front1~0_43 v_~n1~0_34) (< v_~front1~0_43 v_~back1~0_56)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_15| 256) 0)) (= (select |v_#valid_142| v_~queue1~0.base_33) 1) (<= 0 .cse0)))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, ~queue1~0.base=v_~queue1~0.base_33, ~n1~0=v_~n1~0_34, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~back1~0=v_~back1~0_56, ~front1~0=v_~front1~0_43, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_21|, ~n1~0=v_~n1~0_34, ~back1~0=v_~back1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, ~queue1~0.base=v_~queue1~0.base_33, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_7|, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~front1~0=v_~front1~0_42, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~temp~0#1, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem4#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~front1~0] 54062#[L75, L141-4, L48-4]don't care [768] L75-->L83: Formula: (let ((.cse1 (* 4 v_~back2~0_53))) (let ((.cse0 (+ v_~queue2~0.offset_31 .cse1))) (and (not (= (ite (and (< v_~back2~0_53 v_~n2~0_28) (<= 0 v_~back2~0_53)) 1 0) 0)) (= (select |v_#valid_98| v_~queue2~0.base_31) 1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (+ v_~back2~0_53 1) v_~back2~0_52) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (= (+ |v_thread2Thread1of1ForFork2_~temp~0#1_13| 1) (select (select |v_#memory_int_77| v_~queue2~0.base_31) .cse0)) 1 0)) (= v_~d1~0_4 (+ v_~d1~0_5 |v_thread2Thread1of1ForFork2_~temp~0#1_13|)) (<= (+ v_~queue2~0.offset_31 .cse1 4) (select |v_#length_85| v_~queue2~0.base_31))))) InVars {thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, #valid=|v_#valid_98|, ~back2~0=v_~back2~0_53, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_5} OutVars{thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_7|, ~back2~0=v_~back2~0_52, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem6#1, ~back2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~d1~0] 53674#[L141-4, L48-4, L83]don't care [2022-07-22 12:25:33,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:33,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1250997880, now seen corresponding path program 2 times [2022-07-22 12:25:33,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:33,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616234762] [2022-07-22 12:25:33,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:33,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:33,825 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:33,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:33,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:33,879 INFO L85 PathProgramCache]: Analyzing trace with hash 741730, now seen corresponding path program 4 times [2022-07-22 12:25:33,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:33,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40847463] [2022-07-22 12:25:33,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:33,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:33,887 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:33,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:33,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:33,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1045903749, now seen corresponding path program 2 times [2022-07-22 12:25:33,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:33,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237881468] [2022-07-22 12:25:33,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:33,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 12:25:34,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:25:34,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237881468] [2022-07-22 12:25:34,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237881468] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:25:34,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46672867] [2022-07-22 12:25:34,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 12:25:34,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:25:34,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:34,014 INFO L229 MonitoredProcess]: Starting monitored process 125 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:25:34,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-07-22 12:25:34,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 12:25:34,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 12:25:34,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 12:25:34,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 12:25:34,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:25:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 12:25:34,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46672867] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:25:34,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:25:34,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-07-22 12:25:34,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123539080] [2022-07-22 12:25:34,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:25:34,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:25:34,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 12:25:34,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-07-22 12:25:34,749 INFO L87 Difference]: Start difference. First operand 3120 states and 14065 transitions. cyclomatic complexity: 11449 Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:35,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:25:35,553 INFO L93 Difference]: Finished difference Result 7004 states and 29682 transitions. [2022-07-22 12:25:35,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7004 states and 29682 transitions. [2022-07-22 12:25:35,657 INFO L131 ngComponentsAnalysis]: Automaton has 392 accepting balls. 1308 [2022-07-22 12:25:35,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7004 states to 6540 states and 27724 transitions. [2022-07-22 12:25:35,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3006 [2022-07-22 12:25:35,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3006 [2022-07-22 12:25:35,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6540 states and 27724 transitions. [2022-07-22 12:25:35,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:25:35,849 INFO L220 hiAutomatonCegarLoop]: Abstraction has 6540 states and 27724 transitions. [2022-07-22 12:25:35,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6540 states and 27724 transitions. [2022-07-22 12:25:36,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6540 to 4157. [2022-07-22 12:25:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4157 states, 4157 states have (on average 4.462352658166948) internal successors, (18550), 4156 states have internal predecessors, (18550), 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:25:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4157 states to 4157 states and 18550 transitions. [2022-07-22 12:25:36,179 INFO L242 hiAutomatonCegarLoop]: Abstraction has 4157 states and 18550 transitions. [2022-07-22 12:25:36,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 12:25:36,180 INFO L425 stractBuchiCegarLoop]: Abstraction has 4157 states and 18550 transitions. [2022-07-22 12:25:36,181 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 12:25:36,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4157 states and 18550 transitions. [2022-07-22 12:25:36,224 INFO L131 ngComponentsAnalysis]: Automaton has 208 accepting balls. 756 [2022-07-22 12:25:36,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:36,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:36,225 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:36,226 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:25:36,228 INFO L748 eck$LassoCheckResult]: Stem: 65424#[ULTIMATE.startENTRY]don't care [977] ULTIMATE.startENTRY-->L160-6: Formula: (let ((.cse2 (store |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 1))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85| 1))) (let ((.cse0 (select |v_#memory_int_245| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= (ite (< v_~W~0_87 1073741823) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_77| 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|) (< 0 |v_#StackHeapBarrier_64|) (= v_~queue1~0.offset_75 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|) (= v_~queue2~0.offset_85 0) (= (select |v_#valid_354| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205| 0)) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_77|) (= (store (store (store (store (store |v_#length_287| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_89| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_285|) (= |v_#NULL.offset_20| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| v_~n1~0_102) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_51| 0) (= (select |v_#length_287| 2) 24) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t3~0#1.base_85|) (= (select .cse0 0) 48) (= (select |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= v_~d1~0_58 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|) (= v_~back1~0_114 v_~front1~0_96) (= v_~queue1~0.base_75 0) (= v_~front2~0_100 v_~back2~0_134) (= |v_#NULL.base_20| 0) (= v_~v_assert~0_111 1) (= (select .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85|) 0) (= v_~queue2~0.base_85 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t4~0#1.base_89|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_51| 0) (= (select |v_#length_287| 1) 2) (= (select .cse0 1) 0) (= (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1) |v_#valid_352|) (= (select |v_#valid_354| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (= v_~d2~0_57 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_64|) (= (select |v_#valid_354| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_354|, #memory_int=|v_#memory_int_245|, #length=|v_#length_287|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~back2~0=v_~back2~0_134, #NULL.offset=|v_#NULL.offset_20|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_61|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_26|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_56|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_71|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_35|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_43|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_56|, ~queue2~0.base=v_~queue2~0.base_85, #length=|v_#length_285|, ~front1~0=v_~front1~0_96, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_89|, ~queue2~0.offset=v_~queue2~0.offset_85, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_61|, ~back1~0=v_~back1~0_114, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_69|, ~v_assert~0=v_~v_assert~0_111, #StackHeapBarrier=|v_#StackHeapBarrier_64|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_71|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_31|, ~front2~0=v_~front2~0_100, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|, ~n1~0=v_~n1~0_102, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_77|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_85|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_25|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_69|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_51|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_47|, ~W~0=v_~W~0_87, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39|, ~queue1~0.base=v_~queue1~0.base_75, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|, ~d2~0=v_~d2~0_57, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_43|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_52|, ~n2~0=v_~n2~0_100, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_59|, #NULL.base=|v_#NULL.base_20|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_54|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_49|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_67|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_41|, #valid=|v_#valid_352|, #memory_int=|v_#memory_int_245|, ~queue1~0.offset=v_~queue1~0.offset_75, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_77|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_23|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|, ~d1~0=v_~d1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_~#t2~0#1.offset, ~back2~0, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_main_#t~nondet13#1, ~queue2~0.base, #length, ~front1~0, ULTIMATE.start_main_~#t4~0#1.base, ~queue2~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ~back1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~front2~0, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~n1~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ~W~0, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~d2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~nondet10#1, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, #valid, ~queue1~0.offset, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~d1~0] 65238#[L160-6]don't care [921] L160-6-->L160-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1))) (and (= (select |v_#valid_224| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| |v_ULTIMATE.start_create_fresh_int_array_~size#1_67|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1 4) (select |v_#length_179| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 1)) (= (store |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|)) |v_#memory_int_177|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_178|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_37|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_177|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 65240#[L160-6]don't care [921] L160-6-->L160-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1))) (and (= (select |v_#valid_224| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| |v_ULTIMATE.start_create_fresh_int_array_~size#1_67|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1 4) (select |v_#length_179| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 1)) (= (store |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|)) |v_#memory_int_177|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_178|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_37|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_177|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 65242#[L160-6]don't care [967] L160-6-->L160-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~n2~0_86) (= (store |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1) |v_#valid_326|) (= (store |v_#length_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4)) |v_#length_265|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_56|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= v_~queue1~0.offset_65 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|) (= (select |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102| |v_ULTIMATE.start_create_fresh_int_array_~size#1_112|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue1~0.base_65) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102|, #valid=|v_#valid_327|, #length=|v_#length_266|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_112|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_55|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_111|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_63|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ~queue1~0.base=v_~queue1~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_63|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_61|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|, #valid=|v_#valid_326|, #length=|v_#length_265|, ~queue1~0.offset=v_~queue1~0.offset_65, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ~queue1~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 66008#[L160-14]don't care [943] L160-14-->L160-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|))) (and (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63| 4) (select |v_#length_219| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| |v_ULTIMATE.start_create_fresh_int_array_~size#1_85|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 1)) (= (store |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63| (store (select |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|)) |v_#memory_int_207|) (= (select |v_#valid_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_208|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_43|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_207|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 65998#[L160-14]don't care [943] L160-14-->L160-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|))) (and (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63| 4) (select |v_#length_219| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| |v_ULTIMATE.start_create_fresh_int_array_~size#1_85|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 1)) (= (store |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63| (store (select |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|)) |v_#memory_int_207|) (= (select |v_#valid_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_208|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_43|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_207|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 65996#[L160-14]don't care [973] L160-14-->L140-3: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~queue2~0.base_Out_2) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= 0 v_~W~0_In_1) 1 0)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~queue2~0.offset_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|)) |v_#memory_int_Out_2|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ~queue2~0.base=v_~queue2~0.base_Out_2, #length=|v_#length_In_3|, ~queue2~0.offset=v_~queue2~0.offset_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~queue2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~pre17#1, ~queue2~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 65992#[L140-3]don't care [729] L140-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 65984#[thread1ENTRY, L140-4]don't care [690] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 65986#[L48-4, L140-4]don't care [876] L48-4-->L55: Formula: (and (= v_~v_assert~0_40 |v_thread1Thread1of1ForFork0_~cond~0#1_17|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_17| 256) 0)) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_33|)) InVars {~v_assert~0=v_~v_assert~0_40, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_33|} OutVars{~v_assert~0=v_~v_assert~0_40, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_33|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_17|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 67496#[L55, L140-4]don't care [849] L55-->L48-4: Formula: (let ((.cse0 (* 4 v_~back1~0_65))) (let ((.cse1 (+ v_~queue1~0.offset_37 .cse0))) (and (<= (+ v_~queue1~0.offset_37 .cse0 4) (select |v_#length_125| v_~queue1~0.base_37)) (= v_~back1~0_64 (+ v_~back1~0_65 1)) (<= 0 .cse1) (= (ite (= (select (select |v_#memory_int_115| v_~queue1~0.base_37) .cse1) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_23| 1) |v_thread1Thread1of1ForFork0_~w~0#1_24|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_148| v_~queue1~0.base_37) 1) (not (= (ite (and (<= 0 v_~back1~0_65) (< v_~back1~0_65 v_~n1~0_38)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~queue1~0.base=v_~queue1~0.base_37, ~n1~0=v_~n1~0_38, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_115|, ~back1~0=v_~back1~0_65, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_24|, ~queue1~0.offset=v_~queue1~0.offset_37, #length=|v_#length_125|} OutVars{~n1~0=v_~n1~0_38, ~back1~0=v_~back1~0_64, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_11|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_17|, ~queue1~0.base=v_~queue1~0.base_37, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_11|, #valid=|v_#valid_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_115|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_23|, ~queue1~0.offset=v_~queue1~0.offset_37, #length=|v_#length_125|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~back1~0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 67088#[L48-4, L140-4]don't care [926] L140-4-->L141-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_185| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= |v_#pthreadsForks_91| (+ |v_#pthreadsForks_92| 1)) (= (select |v_#valid_230| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (= |v_ULTIMATE.start_main_#t~pre19#1_17| |v_#pthreadsForks_92|) (= (store |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre19#1_17|)) |v_#memory_int_187|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_92|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_230|, #memory_int=|v_#memory_int_188|, #length=|v_#length_185|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_91|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_230|, #memory_int=|v_#memory_int_187|, #length=|v_#length_185|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_17|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] 67080#[L48-4, L141-3]don't care [735] L141-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_2) (= |v_ULTIMATE.start_main_#t~pre19#1_6| v_thread2Thread1of1ForFork2_thidvar0_2) (= 0 v_thread2Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_10|, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_10|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_4|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_4|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_4|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_4|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_2, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_4|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~temp~0#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_#t~post7#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_thidvar2, thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_#t~mem4#1] 67056#[L141-4, L48-4, thread2ENTRY]don't care [796] thread2ENTRY-->L86: Formula: (= |v_thread2Thread1of1ForFork2_~cond~1#1_11| v_~v_assert~0_14) InVars {~v_assert~0=v_~v_assert~0_14} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_11|, ~v_assert~0=v_~v_assert~0_14, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~temp~0#1] 67060#[L141-4, L48-4, L86]don't care [838] L86-->L75: Formula: (let ((.cse1 (* v_~front1~0_43 4))) (let ((.cse0 (+ v_~queue1~0.offset_33 .cse1))) (and (= (+ v_~front1~0_43 1) v_~front1~0_42) (= (select (select |v_#memory_int_107| v_~queue1~0.base_33) .cse0) |v_thread2Thread1of1ForFork2_~temp~0#1_21|) (<= (+ v_~queue1~0.offset_33 .cse1 4) (select |v_#length_119| v_~queue1~0.base_33)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|) (= (ite (and (<= 0 v_~front1~0_43) (< v_~front1~0_43 v_~n1~0_34) (< v_~front1~0_43 v_~back1~0_56)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_15| 256) 0)) (= (select |v_#valid_142| v_~queue1~0.base_33) 1) (<= 0 .cse0)))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, ~queue1~0.base=v_~queue1~0.base_33, ~n1~0=v_~n1~0_34, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~back1~0=v_~back1~0_56, ~front1~0=v_~front1~0_43, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_21|, ~n1~0=v_~n1~0_34, ~back1~0=v_~back1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, ~queue1~0.base=v_~queue1~0.base_33, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_7|, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~front1~0=v_~front1~0_42, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~temp~0#1, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem4#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~front1~0] 68358#[L75, L141-4, L48-4]don't care [768] L75-->L83: Formula: (let ((.cse1 (* 4 v_~back2~0_53))) (let ((.cse0 (+ v_~queue2~0.offset_31 .cse1))) (and (not (= (ite (and (< v_~back2~0_53 v_~n2~0_28) (<= 0 v_~back2~0_53)) 1 0) 0)) (= (select |v_#valid_98| v_~queue2~0.base_31) 1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (+ v_~back2~0_53 1) v_~back2~0_52) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (= (+ |v_thread2Thread1of1ForFork2_~temp~0#1_13| 1) (select (select |v_#memory_int_77| v_~queue2~0.base_31) .cse0)) 1 0)) (= v_~d1~0_4 (+ v_~d1~0_5 |v_thread2Thread1of1ForFork2_~temp~0#1_13|)) (<= (+ v_~queue2~0.offset_31 .cse1 4) (select |v_#length_85| v_~queue2~0.base_31))))) InVars {thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, #valid=|v_#valid_98|, ~back2~0=v_~back2~0_53, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_5} OutVars{thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_7|, ~back2~0=v_~back2~0_52, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem6#1, ~back2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~d1~0] 68248#[L141-4, L48-4, L83]don't care [2022-07-22 12:25:36,229 INFO L750 eck$LassoCheckResult]: Loop: 68248#[L141-4, L48-4, L83]don't care [713] L83-->L86: Formula: (= v_~v_assert~0_2 |v_thread2Thread1of1ForFork2_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_7|, ~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1] 68306#[L141-4, L48-4, L86]don't care [838] L86-->L75: Formula: (let ((.cse1 (* v_~front1~0_43 4))) (let ((.cse0 (+ v_~queue1~0.offset_33 .cse1))) (and (= (+ v_~front1~0_43 1) v_~front1~0_42) (= (select (select |v_#memory_int_107| v_~queue1~0.base_33) .cse0) |v_thread2Thread1of1ForFork2_~temp~0#1_21|) (<= (+ v_~queue1~0.offset_33 .cse1 4) (select |v_#length_119| v_~queue1~0.base_33)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|) (= (ite (and (<= 0 v_~front1~0_43) (< v_~front1~0_43 v_~n1~0_34) (< v_~front1~0_43 v_~back1~0_56)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_15| 256) 0)) (= (select |v_#valid_142| v_~queue1~0.base_33) 1) (<= 0 .cse0)))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, ~queue1~0.base=v_~queue1~0.base_33, ~n1~0=v_~n1~0_34, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~back1~0=v_~back1~0_56, ~front1~0=v_~front1~0_43, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_21|, ~n1~0=v_~n1~0_34, ~back1~0=v_~back1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, ~queue1~0.base=v_~queue1~0.base_33, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_7|, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~front1~0=v_~front1~0_42, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~temp~0#1, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem4#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~front1~0] 68300#[L75, L141-4, L48-4]don't care [768] L75-->L83: Formula: (let ((.cse1 (* 4 v_~back2~0_53))) (let ((.cse0 (+ v_~queue2~0.offset_31 .cse1))) (and (not (= (ite (and (< v_~back2~0_53 v_~n2~0_28) (<= 0 v_~back2~0_53)) 1 0) 0)) (= (select |v_#valid_98| v_~queue2~0.base_31) 1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (+ v_~back2~0_53 1) v_~back2~0_52) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (= (+ |v_thread2Thread1of1ForFork2_~temp~0#1_13| 1) (select (select |v_#memory_int_77| v_~queue2~0.base_31) .cse0)) 1 0)) (= v_~d1~0_4 (+ v_~d1~0_5 |v_thread2Thread1of1ForFork2_~temp~0#1_13|)) (<= (+ v_~queue2~0.offset_31 .cse1 4) (select |v_#length_85| v_~queue2~0.base_31))))) InVars {thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, #valid=|v_#valid_98|, ~back2~0=v_~back2~0_53, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_5} OutVars{thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_7|, ~back2~0=v_~back2~0_52, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem6#1, ~back2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~d1~0] 68248#[L141-4, L48-4, L83]don't care [2022-07-22 12:25:36,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:36,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1513606017, now seen corresponding path program 3 times [2022-07-22 12:25:36,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:36,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848776636] [2022-07-22 12:25:36,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:36,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:36,293 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:36,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:36,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:36,346 INFO L85 PathProgramCache]: Analyzing trace with hash 741730, now seen corresponding path program 5 times [2022-07-22 12:25:36,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:36,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341983969] [2022-07-22 12:25:36,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:36,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:36,355 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:36,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:36,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:36,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1024076318, now seen corresponding path program 3 times [2022-07-22 12:25:36,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:36,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258856150] [2022-07-22 12:25:36,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:36,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:36,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 12:25:36,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:25:36,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258856150] [2022-07-22 12:25:36,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258856150] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:25:36,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:25:36,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:25:36,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614941243] [2022-07-22 12:25:36,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:25:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:25:36,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:25:36,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:25:36,719 INFO L87 Difference]: Start difference. First operand 4157 states and 18550 transitions. cyclomatic complexity: 15085 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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:25:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:25:36,919 INFO L93 Difference]: Finished difference Result 9939 states and 43012 transitions. [2022-07-22 12:25:36,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9939 states and 43012 transitions. [2022-07-22 12:25:37,204 INFO L131 ngComponentsAnalysis]: Automaton has 612 accepting balls. 1968 [2022-07-22 12:25:37,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9939 states to 9785 states and 42144 transitions. [2022-07-22 12:25:37,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4631 [2022-07-22 12:25:37,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4631 [2022-07-22 12:25:37,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9785 states and 42144 transitions. [2022-07-22 12:25:37,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:25:37,349 INFO L220 hiAutomatonCegarLoop]: Abstraction has 9785 states and 42144 transitions. [2022-07-22 12:25:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9785 states and 42144 transitions. [2022-07-22 12:25:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9785 to 6169. [2022-07-22 12:25:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6169 states, 6169 states have (on average 4.513859620684065) internal successors, (27846), 6168 states have internal predecessors, (27846), 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:25:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6169 states to 6169 states and 27846 transitions. [2022-07-22 12:25:37,768 INFO L242 hiAutomatonCegarLoop]: Abstraction has 6169 states and 27846 transitions. [2022-07-22 12:25:37,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:25:37,769 INFO L425 stractBuchiCegarLoop]: Abstraction has 6169 states and 27846 transitions. [2022-07-22 12:25:37,769 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-22 12:25:37,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6169 states and 27846 transitions. [2022-07-22 12:25:37,830 INFO L131 ngComponentsAnalysis]: Automaton has 296 accepting balls. 1020 [2022-07-22 12:25:37,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:37,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:37,832 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:37,832 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:25:37,834 INFO L748 eck$LassoCheckResult]: Stem: 83837#[ULTIMATE.startENTRY]don't care [977] ULTIMATE.startENTRY-->L160-6: Formula: (let ((.cse2 (store |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 1))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85| 1))) (let ((.cse0 (select |v_#memory_int_245| 1)) (.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= (ite (< v_~W~0_87 1073741823) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_77| 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|) (< 0 |v_#StackHeapBarrier_64|) (= v_~queue1~0.offset_75 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|) (= v_~queue2~0.offset_85 0) (= (select |v_#valid_354| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_205| 0)) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_77|) (= (store (store (store (store (store |v_#length_287| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_89| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_285|) (= |v_#NULL.offset_20| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| v_~n1~0_102) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_51| 0) (= (select |v_#length_287| 2) 24) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t3~0#1.base_85|) (= (select .cse0 0) 48) (= (select |v_#valid_354| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_89|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= v_~d1~0_58 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|) (= v_~back1~0_114 v_~front1~0_96) (= v_~queue1~0.base_75 0) (= v_~front2~0_100 v_~back2~0_134) (= |v_#NULL.base_20| 0) (= v_~v_assert~0_111 1) (= (select .cse4 |v_ULTIMATE.start_main_~#t3~0#1.base_85|) 0) (= v_~queue2~0.base_85 0) (< |v_#StackHeapBarrier_64| |v_ULTIMATE.start_main_~#t4~0#1.base_89|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_51| 0) (= (select |v_#length_287| 1) 2) (= (select .cse0 1) 0) (= (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1) |v_#valid_352|) (= (select |v_#valid_354| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (= v_~d2~0_57 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_64|) (= (select |v_#valid_354| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_64|, #valid=|v_#valid_354|, #memory_int=|v_#memory_int_245|, #length=|v_#length_287|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~back2~0=v_~back2~0_134, #NULL.offset=|v_#NULL.offset_20|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_61|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_26|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_56|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_71|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_35|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_43|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_56|, ~queue2~0.base=v_~queue2~0.base_85, #length=|v_#length_285|, ~front1~0=v_~front1~0_96, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_89|, ~queue2~0.offset=v_~queue2~0.offset_85, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_61|, ~back1~0=v_~back1~0_114, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_69|, ~v_assert~0=v_~v_assert~0_111, #StackHeapBarrier=|v_#StackHeapBarrier_64|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_71|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_31|, ~front2~0=v_~front2~0_100, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_109|, ~n1~0=v_~n1~0_102, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_77|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_85|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_25|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_69|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_51|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_47|, ~W~0=v_~W~0_87, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_37|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_39|, ~queue1~0.base=v_~queue1~0.base_75, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_205|, ~d2~0=v_~d2~0_57, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_43|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_52|, ~n2~0=v_~n2~0_100, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_59|, #NULL.base=|v_#NULL.base_20|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_54|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_49|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_67|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_41|, #valid=|v_#valid_352|, #memory_int=|v_#memory_int_245|, ~queue1~0.offset=v_~queue1~0.offset_75, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_77|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_23|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_171|, ~d1~0=v_~d1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_~#t2~0#1.offset, ~back2~0, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_main_#t~nondet13#1, ~queue2~0.base, #length, ~front1~0, ULTIMATE.start_main_~#t4~0#1.base, ~queue2~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ~back1~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~front2~0, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~n1~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ~W~0, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ~d2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#t~nondet10#1, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, #valid, ~queue1~0.offset, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~d1~0] 83641#[L160-6]don't care [921] L160-6-->L160-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1))) (and (= (select |v_#valid_224| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| |v_ULTIMATE.start_create_fresh_int_array_~size#1_67|) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| .cse1 4) (select |v_#length_179| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64| 1)) (= (store |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (store (select |v_#memory_int_178| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|)) |v_#memory_int_177|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_64|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_40|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_178|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_37|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_63|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_177|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 83643#[L160-6]don't care [967] L160-6-->L160-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_111|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~n2~0_86) (= (store |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1) |v_#valid_326|) (= (store |v_#length_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4)) |v_#length_265|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_56|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_111| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_189| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= v_~queue1~0.offset_65 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|) (= (select |v_#valid_327| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102| |v_ULTIMATE.start_create_fresh_int_array_~size#1_112|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92| v_~queue1~0.base_65) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_92|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_92|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_102|, #valid=|v_#valid_327|, #length=|v_#length_266|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_112|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ~n2~0=v_~n2~0_86, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_101|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_55|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_111|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_63|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ~queue1~0.base=v_~queue1~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_63|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_61|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_189|, #valid=|v_#valid_326|, #length=|v_#length_265|, ~queue1~0.offset=v_~queue1~0.offset_65, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~queue1~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ~queue1~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 83151#[L160-14]don't care [943] L160-14-->L160-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|))) (and (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63| 4) (select |v_#length_219| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| |v_ULTIMATE.start_create_fresh_int_array_~size#1_85|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72| 1)) (= (store |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63| (store (select |v_#memory_int_208| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|)) |v_#memory_int_207|) (= (select |v_#valid_266| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_48|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_208|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_63|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_63|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_71|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_43|, #valid=|v_#valid_266|, #memory_int=|v_#memory_int_207|, #length=|v_#length_219|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int] 83153#[L160-14]don't care [973] L160-14-->L140-3: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~queue2~0.base_Out_2) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= 0 v_~W~0_In_1) 1 0)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~queue2~0.offset_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|)) |v_#memory_int_Out_2|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre17#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_5|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ~queue2~0.base=v_~queue2~0.base_Out_2, #length=|v_#length_In_3|, ~queue2~0.offset=v_~queue2~0.offset_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~queue2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~pre17#1, ~queue2~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 83155#[L140-3]don't care [729] L140-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 82935#[thread1ENTRY, L140-4]don't care [690] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 82937#[L48-4, L140-4]don't care [876] L48-4-->L55: Formula: (and (= v_~v_assert~0_40 |v_thread1Thread1of1ForFork0_~cond~0#1_17|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_17| 256) 0)) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_33|)) InVars {~v_assert~0=v_~v_assert~0_40, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_33|} OutVars{~v_assert~0=v_~v_assert~0_40, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_33|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_17|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 90801#[L55, L140-4]don't care [849] L55-->L48-4: Formula: (let ((.cse0 (* 4 v_~back1~0_65))) (let ((.cse1 (+ v_~queue1~0.offset_37 .cse0))) (and (<= (+ v_~queue1~0.offset_37 .cse0 4) (select |v_#length_125| v_~queue1~0.base_37)) (= v_~back1~0_64 (+ v_~back1~0_65 1)) (<= 0 .cse1) (= (ite (= (select (select |v_#memory_int_115| v_~queue1~0.base_37) .cse1) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_23| 1) |v_thread1Thread1of1ForFork0_~w~0#1_24|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= (select |v_#valid_148| v_~queue1~0.base_37) 1) (not (= (ite (and (<= 0 v_~back1~0_65) (< v_~back1~0_65 v_~n1~0_38)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0))))) InVars {~queue1~0.base=v_~queue1~0.base_37, ~n1~0=v_~n1~0_38, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_115|, ~back1~0=v_~back1~0_65, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_24|, ~queue1~0.offset=v_~queue1~0.offset_37, #length=|v_#length_125|} OutVars{~n1~0=v_~n1~0_38, ~back1~0=v_~back1~0_64, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_11|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_17|, ~queue1~0.base=v_~queue1~0.base_37, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_11|, #valid=|v_#valid_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_115|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_23|, ~queue1~0.offset=v_~queue1~0.offset_37, #length=|v_#length_125|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~back1~0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 90803#[L48-4, L140-4]don't care [926] L140-4-->L141-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_185| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= |v_#pthreadsForks_91| (+ |v_#pthreadsForks_92| 1)) (= (select |v_#valid_230| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (= |v_ULTIMATE.start_main_#t~pre19#1_17| |v_#pthreadsForks_92|) (= (store |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_188| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre19#1_17|)) |v_#memory_int_187|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|)) InVars {#pthreadsForks=|v_#pthreadsForks_92|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_230|, #memory_int=|v_#memory_int_188|, #length=|v_#length_185|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_91|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_230|, #memory_int=|v_#memory_int_187|, #length=|v_#length_185|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_17|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] 90839#[L48-4, L141-3]don't care [735] L141-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_2) (= |v_ULTIMATE.start_main_#t~pre19#1_6| v_thread2Thread1of1ForFork2_thidvar0_2) (= 0 v_thread2Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_10|, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_10|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_4|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_4|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_4|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_4|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_2, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_4|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~temp~0#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_#t~post7#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_thidvar2, thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_#t~mem4#1] 83615#[L141-4, L48-4, thread2ENTRY]don't care [922] L141-4-->L142-3: Formula: (and (= (store |v_#memory_int_182| |v_ULTIMATE.start_main_~#t3~0#1.base_41| (store (select |v_#memory_int_182| |v_ULTIMATE.start_main_~#t3~0#1.base_41|) |v_ULTIMATE.start_main_~#t3~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre21#1_35|)) |v_#memory_int_181|) (<= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_39|) (= |v_#pthreadsForks_88| |v_ULTIMATE.start_main_#t~pre21#1_35|) (= (select |v_#valid_226| |v_ULTIMATE.start_main_~#t3~0#1.base_41|) 1) (= |v_#pthreadsForks_87| (+ |v_#pthreadsForks_88| 1)) (<= (+ |v_ULTIMATE.start_main_~#t3~0#1.offset_39| 4) (select |v_#length_181| |v_ULTIMATE.start_main_~#t3~0#1.base_41|))) InVars {#pthreadsForks=|v_#pthreadsForks_88|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_39|, #valid=|v_#valid_226|, #memory_int=|v_#memory_int_182|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|, #length=|v_#length_181|} OutVars{#pthreadsForks=|v_#pthreadsForks_87|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_39|, #valid=|v_#valid_226|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_15|, #memory_int=|v_#memory_int_181|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_41|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_35|, #length=|v_#length_181|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_15|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet20#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~pre19#1] 83585#[L48-4, L142-3, thread2ENTRY]don't care [738] L142-3-->thread3ENTRY: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar0_2 |v_ULTIMATE.start_main_#t~pre21#1_6|) (= v_thread3Thread1of1ForFork3_thidvar1_2 0) (= v_thread3Thread1of1ForFork3_thidvar3_2 0) (= v_thread3Thread1of1ForFork3_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_6|} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2, thread3Thread1of1ForFork3_thidvar3=v_thread3Thread1of1ForFork3_thidvar3_2, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_6|, thread3Thread1of1ForFork3_#res#1.offset=|v_thread3Thread1of1ForFork3_#res#1.offset_4|, thread3Thread1of1ForFork3_~temp~1#1=|v_thread3Thread1of1ForFork3_~temp~1#1_8|, thread3Thread1of1ForFork3_#res#1.base=|v_thread3Thread1of1ForFork3_#res#1.base_4|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_10|, thread3Thread1of1ForFork3_#t~mem8#1=|v_thread3Thread1of1ForFork3_#t~mem8#1_4|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_4|, thread3Thread1of1ForFork3_#t~post9#1=|v_thread3Thread1of1ForFork3_#t~post9#1_4|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1, thread3Thread1of1ForFork3_#res#1.offset, thread3Thread1of1ForFork3_~temp~1#1, thread3Thread1of1ForFork3_thidvar3, thread3Thread1of1ForFork3_#res#1.base, thread3Thread1of1ForFork3_~cond~2#1, thread3Thread1of1ForFork3_#t~mem8#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post9#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1] 82745#[thread2ENTRY, thread3ENTRY, L48-4, L142-4]don't care [757] thread3ENTRY-->L108: Formula: (= |v_thread3Thread1of1ForFork3_~cond~2#1_11| v_~v_assert~0_10) InVars {~v_assert~0=v_~v_assert~0_10} OutVars{~v_assert~0=v_~v_assert~0_10, thread3Thread1of1ForFork3_~temp~1#1=|v_thread3Thread1of1ForFork3_~temp~1#1_9|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_11|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_~temp~1#1, thread3Thread1of1ForFork3_~cond~2#1] 82747#[thread2ENTRY, L108, L48-4, L142-4]don't care [796] thread2ENTRY-->L86: Formula: (= |v_thread2Thread1of1ForFork2_~cond~1#1_11| v_~v_assert~0_14) InVars {~v_assert~0=v_~v_assert~0_14} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_11|, ~v_assert~0=v_~v_assert~0_14, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1#1, thread2Thread1of1ForFork2_~temp~0#1] 82293#[L86, L48-4, L108, L142-4]don't care [838] L86-->L75: Formula: (let ((.cse1 (* v_~front1~0_43 4))) (let ((.cse0 (+ v_~queue1~0.offset_33 .cse1))) (and (= (+ v_~front1~0_43 1) v_~front1~0_42) (= (select (select |v_#memory_int_107| v_~queue1~0.base_33) .cse0) |v_thread2Thread1of1ForFork2_~temp~0#1_21|) (<= (+ v_~queue1~0.offset_33 .cse1 4) (select |v_#length_119| v_~queue1~0.base_33)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|) (= (ite (and (<= 0 v_~front1~0_43) (< v_~front1~0_43 v_~n1~0_34) (< v_~front1~0_43 v_~back1~0_56)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|) (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_15| 256) 0)) (= (select |v_#valid_142| v_~queue1~0.base_33) 1) (<= 0 .cse0)))) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, ~queue1~0.base=v_~queue1~0.base_33, ~n1~0=v_~n1~0_34, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~back1~0=v_~back1~0_56, ~front1~0=v_~front1~0_43, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_15|, thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_21|, ~n1~0=v_~n1~0_34, ~back1~0=v_~back1~0_56, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork2_#t~post5#1=|v_thread2Thread1of1ForFork2_#t~post5#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_15|, ~queue1~0.base=v_~queue1~0.base_33, thread2Thread1of1ForFork2_#t~mem4#1=|v_thread2Thread1of1ForFork2_#t~mem4#1_7|, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_107|, ~front1~0=v_~front1~0_42, ~queue1~0.offset=v_~queue1~0.offset_33, #length=|v_#length_119|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~temp~0#1, thread2Thread1of1ForFork2_#t~post5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem4#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~front1~0] 82703#[L75, L108, L48-4, L142-4]don't care [768] L75-->L83: Formula: (let ((.cse1 (* 4 v_~back2~0_53))) (let ((.cse0 (+ v_~queue2~0.offset_31 .cse1))) (and (not (= (ite (and (< v_~back2~0_53 v_~n2~0_28) (<= 0 v_~back2~0_53)) 1 0) 0)) (= (select |v_#valid_98| v_~queue2~0.base_31) 1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (<= 0 .cse0) (= (+ v_~back2~0_53 1) v_~back2~0_52) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| (ite (= (+ |v_thread2Thread1of1ForFork2_~temp~0#1_13| 1) (select (select |v_#memory_int_77| v_~queue2~0.base_31) .cse0)) 1 0)) (= v_~d1~0_4 (+ v_~d1~0_5 |v_thread2Thread1of1ForFork2_~temp~0#1_13|)) (<= (+ v_~queue2~0.offset_31 .cse1 4) (select |v_#length_85| v_~queue2~0.base_31))))) InVars {thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, #valid=|v_#valid_98|, ~back2~0=v_~back2~0_53, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_5} OutVars{thread2Thread1of1ForFork2_~temp~0#1=|v_thread2Thread1of1ForFork2_~temp~0#1_13|, ~n2~0=v_~n2~0_28, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_7|, ~back2~0=v_~back2~0_52, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, thread2Thread1of1ForFork2_#t~post7#1=|v_thread2Thread1of1ForFork2_#t~post7#1_7|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_77|, ~queue2~0.base=v_~queue2~0.base_31, #length=|v_#length_85|, ~queue2~0.offset=v_~queue2~0.offset_31, ~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem6#1, ~back2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post7#1, ~d1~0] 81647#[L83, L48-4, L108, L142-4]don't care [2022-07-22 12:25:37,835 INFO L750 eck$LassoCheckResult]: Loop: 81647#[L83, L48-4, L108, L142-4]don't care [813] L108-->L102: Formula: (let ((.cse1 (* v_~front2~0_59 4))) (let ((.cse0 (+ v_~queue2~0.offset_37 .cse1))) (and (= (select |v_#valid_128| v_~queue2~0.base_37) 1) (= (select (select |v_#memory_int_99| v_~queue2~0.base_37) .cse0) |v_thread3Thread1of1ForFork3_~temp~1#1_21|) (= (ite (and (< v_~front2~0_59 v_~n2~0_36) (< v_~front2~0_59 v_~back2~0_66) (<= 0 v_~front2~0_59)) 1 0) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_11|) (not (= (mod |v_thread3Thread1of1ForFork3_~cond~2#1_15| 256) 0)) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_11|) (= (+ v_~front2~0_59 1) v_~front2~0_58) (<= 0 .cse0) (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_11| 0)) (<= (+ v_~queue2~0.offset_37 .cse1 4) (select |v_#length_113| v_~queue2~0.base_37))))) InVars {~n2~0=v_~n2~0_36, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_15|, #valid=|v_#valid_128|, ~back2~0=v_~back2~0_66, #memory_int=|v_#memory_int_99|, ~queue2~0.base=v_~queue2~0.base_37, #length=|v_#length_113|, ~front2~0=v_~front2~0_59, ~queue2~0.offset=v_~queue2~0.offset_37} OutVars{~n2~0=v_~n2~0_36, ~back2~0=v_~back2~0_66, thread3Thread1of1ForFork3_~temp~1#1=|v_thread3Thread1of1ForFork3_~temp~1#1_21|, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_15|, #valid=|v_#valid_128|, thread3Thread1of1ForFork3_#t~mem8#1=|v_thread3Thread1of1ForFork3_#t~mem8#1_11|, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_11|, ~queue2~0.base=v_~queue2~0.base_37, #length=|v_#length_113|, ~front2~0=v_~front2~0_58, thread3Thread1of1ForFork3_#t~post9#1=|v_thread3Thread1of1ForFork3_#t~post9#1_11|, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_11|, ~queue2~0.offset=v_~queue2~0.offset_37} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_~temp~1#1, thread3Thread1of1ForFork3_#t~mem8#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~front2~0, thread3Thread1of1ForFork3_#t~post9#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1] 81657#[L102, L83, L48-4, L142-4]don't care [722] L102-->L105: Formula: (= (+ v_~d2~0_2 |v_thread3Thread1of1ForFork3_~temp~1#1_5|) v_~d2~0_1) InVars {thread3Thread1of1ForFork3_~temp~1#1=|v_thread3Thread1of1ForFork3_~temp~1#1_5|, ~d2~0=v_~d2~0_2} OutVars{thread3Thread1of1ForFork3_~temp~1#1=|v_thread3Thread1of1ForFork3_~temp~1#1_5|, ~d2~0=v_~d2~0_1} AuxVars[] AssignedVars[~d2~0] 82489#[L83, L105, L48-4, L142-4]don't care [723] L105-->L108: Formula: (= v_~v_assert~0_4 |v_thread3Thread1of1ForFork3_~cond~2#1_7|) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4, thread3Thread1of1ForFork3_~cond~2#1=|v_thread3Thread1of1ForFork3_~cond~2#1_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_~cond~2#1] 81647#[L83, L48-4, L108, L142-4]don't care [2022-07-22 12:25:37,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:37,835 INFO L85 PathProgramCache]: Analyzing trace with hash -489513436, now seen corresponding path program 1 times [2022-07-22 12:25:37,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:37,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860676899] [2022-07-22 12:25:37,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:37,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:37,912 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:38,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:38,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:38,045 INFO L85 PathProgramCache]: Analyzing trace with hash 834189, now seen corresponding path program 2 times [2022-07-22 12:25:38,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:38,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768335127] [2022-07-22 12:25:38,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:38,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:38,052 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:38,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:38,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:38,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1679997558, now seen corresponding path program 1 times [2022-07-22 12:25:38,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:38,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13652949] [2022-07-22 12:25:38,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:38,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:38,112 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:38,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:44,088 WARN L233 SmtUtils]: Spent 5.78s on a formula simplification. DAG size of input: 387 DAG size of output: 318 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-22 12:25:48,542 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:48,543 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:48,543 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:48,543 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:48,543 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:48,543 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:48,543 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:48,543 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:48,543 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-prod-cons3.wvr.c_BEv2_Iteration12_Lasso [2022-07-22 12:25:48,544 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:48,544 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:48,556 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:25:48,557 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:25:48,558 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:25:48,560 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:25:48,562 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:25:48,564 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:25:48,566 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:25:48,567 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:25:48,569 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:25:48,571 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:25:48,572 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:25:48,574 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:25:48,575 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:25:48,577 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:25:48,585 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:25:48,586 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:25:48,587 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:25:48,589 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:25:48,590 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:25:48,592 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:25:48,594 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:25:48,595 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:25:48,596 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:25:48,598 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:25:48,599 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:25:48,601 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:25:48,602 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:25:48,604 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:25:48,606 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:25:48,607 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:25:48,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:25:48,610 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:25:48,612 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:25:48,613 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:25:48,615 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:25:48,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:25:48,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:25:48,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:25:48,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:25:48,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:25:48,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:25:48,633 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:25:48,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:25:48,637 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:25:48,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:25:48,647 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:25:48,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:25:48,651 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:25:48,652 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:25:48,656 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:25:48,657 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:25:48,661 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:25:48,663 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:25:48,664 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:25:48,666 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:25:48,668 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:25:48,670 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:25:51,114 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:111) 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:25:51,119 INFO L158 Benchmark]: Toolchain (without parser) took 59046.62ms. Allocated memory was 152.0MB in the beginning and 658.5MB in the end (delta: 506.5MB). Free memory was 125.8MB in the beginning and 400.0MB in the end (delta: -274.1MB). Peak memory consumption was 365.1MB. Max. memory is 8.0GB. [2022-07-22 12:25:51,119 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 152.0MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:25:51,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.14ms. Allocated memory is still 152.0MB. Free memory was 125.6MB in the beginning and 114.0MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:25:51,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.40ms. Allocated memory is still 152.0MB. Free memory was 113.8MB in the beginning and 111.0MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-07-22 12:25:51,122 INFO L158 Benchmark]: Boogie Preprocessor took 86.69ms. Allocated memory is still 152.0MB. Free memory was 111.0MB in the beginning and 109.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:25:51,122 INFO L158 Benchmark]: RCFGBuilder took 1013.86ms. Allocated memory is still 152.0MB. Free memory was 109.1MB in the beginning and 115.8MB in the end (delta: -6.8MB). Peak memory consumption was 16.5MB. Max. memory is 8.0GB. [2022-07-22 12:25:51,122 INFO L158 Benchmark]: BuchiAutomizer took 57478.85ms. Allocated memory was 152.0MB in the beginning and 658.5MB in the end (delta: 506.5MB). Free memory was 115.8MB in the beginning and 400.0MB in the end (delta: -284.1MB). Peak memory consumption was 354.9MB. Max. memory is 8.0GB. [2022-07-22 12:25:51,124 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.33ms. Allocated memory is still 152.0MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 369.14ms. Allocated memory is still 152.0MB. Free memory was 125.6MB in the beginning and 114.0MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 85.40ms. Allocated memory is still 152.0MB. Free memory was 113.8MB in the beginning and 111.0MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 86.69ms. Allocated memory is still 152.0MB. Free memory was 111.0MB in the beginning and 109.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1013.86ms. Allocated memory is still 152.0MB. Free memory was 109.1MB in the beginning and 115.8MB in the end (delta: -6.8MB). Peak memory consumption was 16.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 57478.85ms. Allocated memory was 152.0MB in the beginning and 658.5MB in the end (delta: 506.5MB). Free memory was 115.8MB in the beginning and 400.0MB in the end (delta: -284.1MB). Peak memory consumption was 354.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3s, 222 PlacesBefore, 44 PlacesAfterwards, 227 TransitionsBefore, 36 TransitionsAfterwards, 2284 CoEnabledTransitionPairs, 8 FixpointIterations, 151 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 30 TrivialYvCompositions, 9 ConcurrentYvCompositions, 13 ChoiceCompositions, 235 TotalNumberOfCompositions, 4437 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3302, positive: 3182, positive conditional: 0, positive unconditional: 3182, negative: 120, negative conditional: 0, negative unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1594, positive: 1561, positive conditional: 0, positive unconditional: 1561, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1594, positive: 1559, positive conditional: 0, positive unconditional: 1559, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 154, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 133, negative conditional: 0, negative unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3302, positive: 1621, positive conditional: 0, positive unconditional: 1621, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 1594, unknown conditional: 0, unknown unconditional: 1594] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 208, Positive conditional cache size: 0, Positive unconditional cache size: 208, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - 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:25:51,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Ended with exit code 0 [2022-07-22 12:25:51,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:51,571 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...