/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-queue-add-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 13:57:02,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 13:57:02,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 13:57:02,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 13:57:02,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 13:57:02,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 13:57:02,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 13:57:02,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 13:57:02,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 13:57:02,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 13:57:02,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 13:57:02,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 13:57:02,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 13:57:02,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 13:57:02,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 13:57:02,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 13:57:02,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 13:57:02,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 13:57:02,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 13:57:02,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 13:57:02,569 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 13:57:02,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 13:57:02,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 13:57:02,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 13:57:02,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 13:57:02,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 13:57:02,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 13:57:02,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 13:57:02,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 13:57:02,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 13:57:02,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 13:57:02,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 13:57:02,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 13:57:02,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 13:57:02,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 13:57:02,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 13:57:02,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 13:57:02,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 13:57:02,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 13:57:02,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 13:57:02,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 13:57:02,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 13:57:02,585 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-26 13:57:02,609 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 13:57:02,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 13:57:02,609 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 13:57:02,609 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 13:57:02,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 13:57:02,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 13:57:02,610 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 13:57:02,611 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 13:57:02,611 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 13:57:02,611 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 13:57:02,612 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 13:57:02,612 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 13:57:02,612 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 13:57:02,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 13:57:02,612 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 13:57:02,612 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 13:57:02,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 13:57:02,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 13:57:02,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 13:57:02,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 13:57:02,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 13:57:02,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 13:57:02,613 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 13:57:02,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 13:57:02,613 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 13:57:02,613 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 13:57:02,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 13:57:02,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 13:57:02,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 13:57:02,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 13:57:02,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 13:57:02,614 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 13:57:02,614 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-26 13:57:02,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 13:57:02,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 13:57:02,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 13:57:02,824 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 13:57:02,825 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 13:57:02,826 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2022-07-26 13:57:02,871 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c08dcc101/3ecab5f80e1f4f18adab40abd606232d/FLAG7f9b2439a [2022-07-26 13:57:03,253 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 13:57:03,254 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2022-07-26 13:57:03,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c08dcc101/3ecab5f80e1f4f18adab40abd606232d/FLAG7f9b2439a [2022-07-26 13:57:03,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c08dcc101/3ecab5f80e1f4f18adab40abd606232d [2022-07-26 13:57:03,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 13:57:03,279 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 13:57:03,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 13:57:03,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 13:57:03,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 13:57:03,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:57:03" (1/1) ... [2022-07-26 13:57:03,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bfb78c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:03, skipping insertion in model container [2022-07-26 13:57:03,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:57:03" (1/1) ... [2022-07-26 13:57:03,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 13:57:03,305 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 13:57:03,494 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-queue-add-2.wvr.c[2696,2709] [2022-07-26 13:57:03,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:57:03,511 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 13:57:03,545 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-queue-add-2.wvr.c[2696,2709] [2022-07-26 13:57:03,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:57:03,564 INFO L208 MainTranslator]: Completed translation [2022-07-26 13:57:03,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:03 WrapperNode [2022-07-26 13:57:03,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 13:57:03,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 13:57:03,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 13:57:03,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 13:57:03,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:03" (1/1) ... [2022-07-26 13:57:03,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:03" (1/1) ... [2022-07-26 13:57:03,605 INFO L137 Inliner]: procedures = 24, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 150 [2022-07-26 13:57:03,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 13:57:03,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 13:57:03,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 13:57:03,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 13:57:03,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:03" (1/1) ... [2022-07-26 13:57:03,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:03" (1/1) ... [2022-07-26 13:57:03,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:03" (1/1) ... [2022-07-26 13:57:03,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:03" (1/1) ... [2022-07-26 13:57:03,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:03" (1/1) ... [2022-07-26 13:57:03,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:03" (1/1) ... [2022-07-26 13:57:03,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:03" (1/1) ... [2022-07-26 13:57:03,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 13:57:03,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 13:57:03,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 13:57:03,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 13:57:03,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:03" (1/1) ... [2022-07-26 13:57:03,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:03,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:03,672 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-26 13:57:03,674 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-26 13:57:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 13:57:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 13:57:03,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 13:57:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 13:57:03,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 13:57:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 13:57:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 13:57:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 13:57:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 13:57:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 13:57:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-26 13:57:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 13:57:03,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 13:57:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 13:57:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 13:57:03,705 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 13:57:03,807 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 13:57:03,808 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 13:57:04,099 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 13:57:04,185 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 13:57:04,185 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-26 13:57:04,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:57:04 BoogieIcfgContainer [2022-07-26 13:57:04,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 13:57:04,188 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 13:57:04,188 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 13:57:04,191 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 13:57:04,191 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:57:04,191 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 01:57:03" (1/3) ... [2022-07-26 13:57:04,192 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f570ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:57:04, skipping insertion in model container [2022-07-26 13:57:04,192 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:57:04,192 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:03" (2/3) ... [2022-07-26 13:57:04,192 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f570ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:57:04, skipping insertion in model container [2022-07-26 13:57:04,192 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:57:04,192 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:57:04" (3/3) ... [2022-07-26 13:57:04,193 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2022-07-26 13:57:04,271 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 13:57:04,296 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 133 transitions, 282 flow [2022-07-26 13:57:04,348 INFO L129 PetriNetUnfolder]: 11/129 cut-off events. [2022-07-26 13:57:04,348 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:57:04,352 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 129 events. 11/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 95. Up to 3 conditions per place. [2022-07-26 13:57:04,353 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 133 transitions, 282 flow [2022-07-26 13:57:04,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 129 transitions, 270 flow [2022-07-26 13:57:04,366 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-26 13:57:04,378 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 129 transitions, 270 flow [2022-07-26 13:57:04,381 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 129 transitions, 270 flow [2022-07-26 13:57:04,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 129 transitions, 270 flow [2022-07-26 13:57:04,421 INFO L129 PetriNetUnfolder]: 11/129 cut-off events. [2022-07-26 13:57:04,422 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:57:04,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 129 events. 11/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 95. Up to 3 conditions per place. [2022-07-26 13:57:04,424 INFO L116 LiptonReduction]: Number of co-enabled transitions 538 [2022-07-26 13:57:08,514 INFO L131 LiptonReduction]: Checked pairs total: 668 [2022-07-26 13:57:08,514 INFO L133 LiptonReduction]: Total number of compositions: 137 [2022-07-26 13:57:08,526 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 13:57:08,527 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 13:57:08,527 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 13:57:08,527 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 13:57:08,527 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 13:57:08,527 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 13:57:08,527 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 13:57:08,527 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 13:57:08,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 13:57:08,546 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2022-07-26 13:57:08,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:57:08,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:57:08,550 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 13:57:08,550 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:57:08,550 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 13:57:08,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 34 states, but on-demand construction may add more states [2022-07-26 13:57:08,552 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2022-07-26 13:57:08,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:57:08,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:57:08,552 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 13:57:08,552 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:57:08,555 INFO L733 eck$LassoCheckResult]: Stem: 130#[ULTIMATE.startENTRY]don't care [598] ULTIMATE.startENTRY-->L108-6: Formula: (let ((.cse1 (store |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55| 1)) (.cse0 (select |v_#memory_int_172| 1))) (and (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| v_~n~0_107) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= v_~q~0.base_108 0) (= (select .cse0 0) 48) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_27|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55|) 0) (= (select |v_#valid_207| 2) 1) (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) (= 2 (select |v_#length_178| 1)) (= v_~q~0.offset_108 0) (= (select |v_#length_178| 2) 25) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= v_~s~0_55 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1) |v_#valid_206|) (= (select |v_#valid_207| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| 0)) (< 0 |v_#StackHeapBarrier_27|) (= v_~q_back~0_176 v_~q_front~0_106) (= (select |v_#valid_207| 0) 0) (= (select .cse0 1) 0) (= |v_#NULL.offset_8| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= (store (store (store |v_#length_178| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_55| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_177|) (= |v_#NULL.base_8| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_27|, #valid=|v_#valid_207|, #memory_int=|v_#memory_int_172|, #length=|v_#length_178|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~q_back~0=v_~q_back~0_176, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_32|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ~q~0.offset=v_~q~0.offset_108, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_43|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_119|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_24|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_37|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, #length=|v_#length_177|, ~q_front~0=v_~q_front~0_106, ~s~0=v_~s~0_55, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_39|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_36|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_20|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ~q~0.base=v_~q~0.base_108, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_32|, #StackHeapBarrier=|v_#StackHeapBarrier_27|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_37|, #valid=|v_#valid_206|, #memory_int=|v_#memory_int_172|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_39|, ~n~0=v_~n~0_107, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ~q_front~0, ~s~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 133#[L108-6]don't care [2022-07-26 13:57:08,556 INFO L735 eck$LassoCheckResult]: Loop: 133#[L108-6]don't care [582] L108-6-->L108-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|))) (and (= (select |v_#valid_174| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|) (= (store |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29| (store (select |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|)) |v_#memory_int_150|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 1)) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29| 4) (select |v_#length_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_151|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_19|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_150|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post19#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1] 133#[L108-6]don't care [2022-07-26 13:57:08,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:08,562 INFO L85 PathProgramCache]: Analyzing trace with hash 629, now seen corresponding path program 1 times [2022-07-26 13:57:08,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:08,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982734222] [2022-07-26 13:57:08,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:08,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:08,640 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:08,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:08,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:08,671 INFO L85 PathProgramCache]: Analyzing trace with hash 613, now seen corresponding path program 1 times [2022-07-26 13:57:08,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:08,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047182087] [2022-07-26 13:57:08,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:08,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:08,691 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:08,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:08,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:08,701 INFO L85 PathProgramCache]: Analyzing trace with hash 20081, now seen corresponding path program 1 times [2022-07-26 13:57:08,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:08,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408468574] [2022-07-26 13:57:08,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:08,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:08,723 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:08,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:09,168 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:57:09,168 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:57:09,168 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:57:09,168 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:57:09,169 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:57:09,169 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:09,169 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:57:09,169 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:57:09,169 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-queue-add-2.wvr.c_BEv2_Iteration1_Lasso [2022-07-26 13:57:09,169 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:57:09,169 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:57:09,184 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,190 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,192 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,195 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,196 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,198 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,199 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,201 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,406 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,408 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,410 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,412 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,416 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,418 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,419 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,423 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,424 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,426 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,427 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,429 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,431 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,433 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,435 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,438 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,440 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,441 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,443 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,444 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,446 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,447 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,449 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,450 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:09,773 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:57:09,776 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:57:09,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:09,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:09,779 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-26 13:57:09,782 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-26 13:57:09,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:09,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:09,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:09,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:09,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:09,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:09,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:09,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:09,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:09,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:09,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:09,832 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-26 13:57:09,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:09,843 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-26 13:57:09,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:09,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:09,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:09,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:09,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:09,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:09,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:09,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:09,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-26 13:57:09,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:09,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:09,876 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-26 13:57:09,877 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-26 13:57:09,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:09,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:09,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:09,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:09,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:09,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:09,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:09,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:09,915 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-26 13:57:09,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:09,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:09,917 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-26 13:57:09,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-26 13:57:09,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:09,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:09,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:09,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:09,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:09,936 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-26 13:57:09,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:09,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:09,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:09,970 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-26 13:57:09,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:09,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:09,972 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-26 13:57:09,973 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-26 13:57:09,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-26 13:57:09,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:09,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:09,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:09,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:09,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:09,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:09,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:09,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:10,000 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-26 13:57:10,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,001 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-26 13:57:10,002 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-26 13:57:10,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:10,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:10,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:10,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:10,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:10,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:10,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:10,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:10,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:10,042 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-26 13:57:10,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,044 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-26 13:57:10,044 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-26 13:57:10,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-26 13:57:10,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:10,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:10,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:10,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:10,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:10,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:10,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:10,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:10,091 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-26 13:57:10,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,092 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-26 13:57:10,092 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-26 13:57:10,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:10,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:10,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:10,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:10,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:10,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:10,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:10,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:10,127 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-26 13:57:10,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,128 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-26 13:57:10,129 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-26 13:57:10,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-26 13:57:10,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:10,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:10,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:10,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:10,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:10,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:10,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:10,169 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-26 13:57:10,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,170 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-26 13:57:10,171 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-26 13:57:10,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-26 13:57:10,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:10,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:10,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:10,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:10,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:10,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:10,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:10,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:10,205 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-26 13:57:10,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,207 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-26 13:57:10,208 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-26 13:57:10,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-26 13:57:10,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:10,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:10,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:10,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:10,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:10,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:10,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:10,264 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-26 13:57:10,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,265 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-26 13:57:10,266 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-26 13:57:10,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-26 13:57:10,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:10,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:10,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:10,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:10,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:10,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:10,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:10,309 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-26 13:57:10,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,311 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-26 13:57:10,312 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-26 13:57:10,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:10,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:10,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:10,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:10,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:10,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:10,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:10,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:10,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:10,357 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-26 13:57:10,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,359 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-26 13:57:10,360 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-26 13:57:10,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-26 13:57:10,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:10,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:10,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:10,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:10,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:10,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:10,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:10,407 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-26 13:57:10,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,408 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-26 13:57:10,409 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-26 13:57:10,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:10,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:10,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:10,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:10,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:10,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:10,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:10,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:10,453 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-26 13:57:10,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,460 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-26 13:57:10,461 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-26 13:57:10,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-26 13:57:10,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:10,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:10,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:10,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:10,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:10,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:10,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:10,501 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-26 13:57:10,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,502 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-26 13:57:10,502 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-26 13:57:10,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:10,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:10,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:10,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:10,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:10,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:10,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:10,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:10,532 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-26 13:57:10,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,533 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-26 13:57:10,536 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-26 13:57:10,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-26 13:57:10,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:10,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:10,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:10,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:10,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:10,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:10,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:10,575 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-26 13:57:10,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,576 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-26 13:57:10,578 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-26 13:57:10,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-26 13:57:10,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:10,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:10,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:10,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:10,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:10,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:10,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:10,606 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-26 13:57:10,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,607 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-26 13:57:10,608 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-26 13:57:10,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-26 13:57:10,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:10,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:10,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:10,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:10,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:10,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:10,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:10,636 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-26 13:57:10,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,638 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-26 13:57:10,640 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-26 13:57:10,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:10,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:10,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:10,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:10,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:10,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:10,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:10,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:10,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:10,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,694 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-26 13:57:10,695 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-26 13:57:10,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:10,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:10,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:10,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:10,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:10,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:10,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:10,723 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:57:10,748 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-26 13:57:10,748 INFO L444 ModelExtractionUtils]: 12 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-07-26 13:57:10,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:10,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:10,751 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-26 13:57:10,776 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:57:10,784 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-26 13:57:10,799 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 13:57:10,800 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:57:10,800 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~1#1, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1) = -1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset - 4*ULTIMATE.start_create_fresh_int_array_~i~1#1 + 2*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 Supporting invariants [] [2022-07-26 13:57:10,824 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-26 13:57:10,859 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-26 13:57:10,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:10,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 13:57:10,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:10,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 13:57:10,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:10,914 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-26 13:57:10,937 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 13:57:10,939 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 34 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-26 13:57:10,997 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 34 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 68 states and 150 transitions. Complement of second has 5 states. [2022-07-26 13:57:10,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 13:57:11,004 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-26 13:57:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-07-26 13:57:11,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-26 13:57:11,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:11,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-26 13:57:11,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:11,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-26 13:57:11,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:11,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 150 transitions. [2022-07-26 13:57:11,015 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-26 13:57:11,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 30 states and 66 transitions. [2022-07-26 13:57:11,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-26 13:57:11,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-26 13:57:11,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 66 transitions. [2022-07-26 13:57:11,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:57:11,021 INFO L220 hiAutomatonCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-26 13:57:11,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 66 transitions. [2022-07-26 13:57:11,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-26 13:57:11,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.2) internal successors, (66), 29 states have internal predecessors, (66), 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-26 13:57:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 66 transitions. [2022-07-26 13:57:11,043 INFO L242 hiAutomatonCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-26 13:57:11,043 INFO L426 stractBuchiCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-26 13:57:11,043 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 13:57:11,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 66 transitions. [2022-07-26 13:57:11,045 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-26 13:57:11,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:57:11,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:57:11,046 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 13:57:11,046 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:57:11,047 INFO L733 eck$LassoCheckResult]: Stem: 400#[ULTIMATE.startENTRY]don't care [598] ULTIMATE.startENTRY-->L108-6: Formula: (let ((.cse1 (store |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55| 1)) (.cse0 (select |v_#memory_int_172| 1))) (and (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| v_~n~0_107) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= v_~q~0.base_108 0) (= (select .cse0 0) 48) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_27|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55|) 0) (= (select |v_#valid_207| 2) 1) (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) (= 2 (select |v_#length_178| 1)) (= v_~q~0.offset_108 0) (= (select |v_#length_178| 2) 25) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= v_~s~0_55 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1) |v_#valid_206|) (= (select |v_#valid_207| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| 0)) (< 0 |v_#StackHeapBarrier_27|) (= v_~q_back~0_176 v_~q_front~0_106) (= (select |v_#valid_207| 0) 0) (= (select .cse0 1) 0) (= |v_#NULL.offset_8| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= (store (store (store |v_#length_178| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_55| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_177|) (= |v_#NULL.base_8| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_27|, #valid=|v_#valid_207|, #memory_int=|v_#memory_int_172|, #length=|v_#length_178|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~q_back~0=v_~q_back~0_176, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_32|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ~q~0.offset=v_~q~0.offset_108, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_43|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_119|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_24|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_37|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, #length=|v_#length_177|, ~q_front~0=v_~q_front~0_106, ~s~0=v_~s~0_55, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_39|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_36|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_20|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ~q~0.base=v_~q~0.base_108, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_32|, #StackHeapBarrier=|v_#StackHeapBarrier_27|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_37|, #valid=|v_#valid_206|, #memory_int=|v_#memory_int_172|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_39|, ~n~0=v_~n~0_107, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ~q_front~0, ~s~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 402#[L108-6]don't care [596] L108-6-->L92-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre12#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= (store |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |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~pre12#1_Out_2|)) |v_#memory_int_Out_2|) (= v_~q~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~q~0.base_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_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_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~q~0.base=v_~q~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~q~0.offset=v_~q~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_2|, #valid=|v_#valid_In_7|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_2|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 384#[L92-3]don't care [456] L92-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_12|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#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~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] 372#[thread1ENTRY, L92-4]don't care [433] thread1ENTRY-->L47-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 374#[L47-4, L92-4]don't care [2022-07-26 13:57:11,049 INFO L735 eck$LassoCheckResult]: Loop: 374#[L47-4, L92-4]don't care [561] L47-4-->L47-4: Formula: (let ((.cse1 (* v_~q_back~0_141 4))) (let ((.cse0 (+ v_~q~0.offset_76 .cse1))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| 0)) (<= 0 .cse0) (< |v_thread1Thread1of1ForFork0_~i~0#1_40| v_~N~0_41) (= 1 (select |v_#valid_136| v_~q~0.base_76)) (<= (+ v_~q~0.offset_76 4 .cse1) (select |v_#length_115| v_~q~0.base_76)) (= (ite (= (select (select |v_#memory_int_114| v_~q~0.base_76) .cse0) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= (ite (and (< v_~q_back~0_141 v_~n~0_81) (<= 0 v_~q_back~0_141)) 1 0) 0)) (= (+ v_~q_back~0_141 1) v_~q_back~0_140) (= |v_thread1Thread1of1ForFork0_~i~0#1_39| (+ |v_thread1Thread1of1ForFork0_~i~0#1_40| 1))))) InVars {~q_back~0=v_~q_back~0_141, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_40|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~n~0=v_~n~0_81, ~q~0.offset=v_~q~0.offset_76} OutVars{~q_back~0=v_~q_back~0_140, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_13|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~q~0.offset=v_~q~0.offset_76, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_39|, #valid=|v_#valid_136|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~n~0=v_~n~0_81} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] 374#[L47-4, L92-4]don't care [2022-07-26 13:57:11,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash 19325864, now seen corresponding path program 1 times [2022-07-26 13:57:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:11,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985552516] [2022-07-26 13:57:11,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:11,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:11,091 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:11,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:11,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:11,123 INFO L85 PathProgramCache]: Analyzing trace with hash 592, now seen corresponding path program 1 times [2022-07-26 13:57:11,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:11,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623040869] [2022-07-26 13:57:11,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:11,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:11,130 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:11,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:11,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:11,136 INFO L85 PathProgramCache]: Analyzing trace with hash 599102345, now seen corresponding path program 1 times [2022-07-26 13:57:11,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:11,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311057450] [2022-07-26 13:57:11,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:11,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:11,184 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-26 13:57:11,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:57:11,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311057450] [2022-07-26 13:57:11,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311057450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:57:11,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:57:11,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 13:57:11,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838787329] [2022-07-26 13:57:11,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:57:11,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:11,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:57:11,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 13:57:11,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 13:57:11,313 INFO L87 Difference]: Start difference. First operand 30 states and 66 transitions. cyclomatic complexity: 51 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:57:11,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:57:11,366 INFO L93 Difference]: Finished difference Result 43 states and 85 transitions. [2022-07-26 13:57:11,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 85 transitions. [2022-07-26 13:57:11,369 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-26 13:57:11,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 65 transitions. [2022-07-26 13:57:11,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-26 13:57:11,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-26 13:57:11,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 65 transitions. [2022-07-26 13:57:11,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:57:11,370 INFO L220 hiAutomatonCegarLoop]: Abstraction has 30 states and 65 transitions. [2022-07-26 13:57:11,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 65 transitions. [2022-07-26 13:57:11,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-26 13:57:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 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-26 13:57:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 65 transitions. [2022-07-26 13:57:11,377 INFO L242 hiAutomatonCegarLoop]: Abstraction has 30 states and 65 transitions. [2022-07-26 13:57:11,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 13:57:11,377 INFO L426 stractBuchiCegarLoop]: Abstraction has 30 states and 65 transitions. [2022-07-26 13:57:11,377 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 13:57:11,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 65 transitions. [2022-07-26 13:57:11,380 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-26 13:57:11,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:57:11,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:57:11,380 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-26 13:57:11,380 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:57:11,381 INFO L733 eck$LassoCheckResult]: Stem: 514#[ULTIMATE.startENTRY]don't care [598] ULTIMATE.startENTRY-->L108-6: Formula: (let ((.cse1 (store |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55| 1)) (.cse0 (select |v_#memory_int_172| 1))) (and (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| v_~n~0_107) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= v_~q~0.base_108 0) (= (select .cse0 0) 48) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_27|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55|) 0) (= (select |v_#valid_207| 2) 1) (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) (= 2 (select |v_#length_178| 1)) (= v_~q~0.offset_108 0) (= (select |v_#length_178| 2) 25) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= v_~s~0_55 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1) |v_#valid_206|) (= (select |v_#valid_207| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| 0)) (< 0 |v_#StackHeapBarrier_27|) (= v_~q_back~0_176 v_~q_front~0_106) (= (select |v_#valid_207| 0) 0) (= (select .cse0 1) 0) (= |v_#NULL.offset_8| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= (store (store (store |v_#length_178| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_55| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_177|) (= |v_#NULL.base_8| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_27|, #valid=|v_#valid_207|, #memory_int=|v_#memory_int_172|, #length=|v_#length_178|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~q_back~0=v_~q_back~0_176, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_32|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ~q~0.offset=v_~q~0.offset_108, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_43|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_119|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_24|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_37|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, #length=|v_#length_177|, ~q_front~0=v_~q_front~0_106, ~s~0=v_~s~0_55, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_39|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_36|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_20|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ~q~0.base=v_~q~0.base_108, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_32|, #StackHeapBarrier=|v_#StackHeapBarrier_27|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_37|, #valid=|v_#valid_206|, #memory_int=|v_#memory_int_172|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_39|, ~n~0=v_~n~0_107, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ~q_front~0, ~s~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 516#[L108-6]don't care [582] L108-6-->L108-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|))) (and (= (select |v_#valid_174| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|) (= (store |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29| (store (select |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|)) |v_#memory_int_150|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 1)) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29| 4) (select |v_#length_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_151|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_19|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_150|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post19#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1] 522#[L108-6]don't care [596] L108-6-->L92-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre12#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= (store |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |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~pre12#1_Out_2|)) |v_#memory_int_Out_2|) (= v_~q~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~q~0.base_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_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_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~q~0.base=v_~q~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~q~0.offset=v_~q~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_2|, #valid=|v_#valid_In_7|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_2|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 498#[L92-3]don't care [456] L92-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_12|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#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~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] 486#[thread1ENTRY, L92-4]don't care [433] thread1ENTRY-->L47-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 488#[L47-4, L92-4]don't care [2022-07-26 13:57:11,381 INFO L735 eck$LassoCheckResult]: Loop: 488#[L47-4, L92-4]don't care [561] L47-4-->L47-4: Formula: (let ((.cse1 (* v_~q_back~0_141 4))) (let ((.cse0 (+ v_~q~0.offset_76 .cse1))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| 0)) (<= 0 .cse0) (< |v_thread1Thread1of1ForFork0_~i~0#1_40| v_~N~0_41) (= 1 (select |v_#valid_136| v_~q~0.base_76)) (<= (+ v_~q~0.offset_76 4 .cse1) (select |v_#length_115| v_~q~0.base_76)) (= (ite (= (select (select |v_#memory_int_114| v_~q~0.base_76) .cse0) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= (ite (and (< v_~q_back~0_141 v_~n~0_81) (<= 0 v_~q_back~0_141)) 1 0) 0)) (= (+ v_~q_back~0_141 1) v_~q_back~0_140) (= |v_thread1Thread1of1ForFork0_~i~0#1_39| (+ |v_thread1Thread1of1ForFork0_~i~0#1_40| 1))))) InVars {~q_back~0=v_~q_back~0_141, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_40|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~n~0=v_~n~0_81, ~q~0.offset=v_~q~0.offset_76} OutVars{~q_back~0=v_~q_back~0_140, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_13|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~q~0.offset=v_~q~0.offset_76, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_39|, #valid=|v_#valid_136|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~n~0=v_~n~0_81} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] 488#[L47-4, L92-4]don't care [2022-07-26 13:57:11,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:11,381 INFO L85 PathProgramCache]: Analyzing trace with hash 598820396, now seen corresponding path program 1 times [2022-07-26 13:57:11,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:11,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034568237] [2022-07-26 13:57:11,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:11,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:11,422 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:11,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:11,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:11,439 INFO L85 PathProgramCache]: Analyzing trace with hash 592, now seen corresponding path program 2 times [2022-07-26 13:57:11,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:11,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400650388] [2022-07-26 13:57:11,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:11,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:11,455 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:11,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:11,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1383563653, now seen corresponding path program 1 times [2022-07-26 13:57:11,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:11,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412066614] [2022-07-26 13:57:11,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:11,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:11,491 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:11,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:12,425 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:57:12,426 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:57:12,426 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:57:12,426 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:57:12,426 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:57:12,426 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:12,426 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:57:12,426 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:57:12,426 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-queue-add-2.wvr.c_BEv2_Iteration3_Lasso [2022-07-26 13:57:12,426 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:57:12,426 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:57:12,448 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,937 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,941 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,943 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,946 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,947 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,949 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,951 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,955 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,956 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,958 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,960 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,962 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,969 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,971 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,973 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,974 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,976 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,977 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,979 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,982 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,984 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,986 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,988 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,991 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,993 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,995 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,997 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:12,999 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:13,001 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:13,003 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:13,005 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:13,009 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:13,011 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:13,013 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:13,501 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:57:13,501 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:57:13,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:13,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:13,502 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-26 13:57:13,503 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-26 13:57:13,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-26 13:57:13,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:13,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:13,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:13,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:13,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:13,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:13,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:13,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:13,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:13,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:13,547 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-26 13:57:13,548 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-26 13:57:13,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:13,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:13,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:13,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:13,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:13,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:13,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:13,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:13,599 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-26 13:57:13,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:13,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:13,600 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-26 13:57:13,600 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-26 13:57:13,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-26 13:57:13,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:13,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:13,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:13,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:13,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:13,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:13,624 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:13,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:13,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:13,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:13,644 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-26 13:57:13,645 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-26 13:57:13,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-26 13:57:13,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:13,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:13,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:13,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:13,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:13,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:13,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:13,690 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-26 13:57:13,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:13,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:13,691 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-26 13:57:13,692 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-26 13:57:13,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-26 13:57:13,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:13,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:13,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:13,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:13,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:13,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:13,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:13,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-26 13:57:13,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:13,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:13,740 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-26 13:57:13,741 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-26 13:57:13,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:13,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:13,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:13,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:13,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:13,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:13,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:13,767 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:57:13,797 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-07-26 13:57:13,797 INFO L444 ModelExtractionUtils]: 17 out of 40 variables were initially zero. Simplification set additionally 20 variables to zero. [2022-07-26 13:57:13,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:13,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:13,798 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-26 13:57:13,798 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-26 13:57:13,800 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:57:13,820 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 13:57:13,821 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:57:13,821 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_back~0, ~n~0) = -1*~q_back~0 + 1*~n~0 Supporting invariants [] [2022-07-26 13:57:13,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-26 13:57:13,904 INFO L156 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2022-07-26 13:57:13,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:13,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 13:57:13,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:13,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 13:57:13,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:13,948 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-26 13:57:13,948 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 13:57:13,948 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 65 transitions. cyclomatic complexity: 50 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:57:13,986 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 65 transitions. cyclomatic complexity: 50. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 78 states and 199 transitions. Complement of second has 4 states. [2022-07-26 13:57:13,986 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-26 13:57:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:57:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-07-26 13:57:13,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-26 13:57:13,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:13,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-26 13:57:13,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:13,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-26 13:57:13,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:13,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 199 transitions. [2022-07-26 13:57:13,988 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2022-07-26 13:57:13,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 57 states and 142 transitions. [2022-07-26 13:57:13,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-26 13:57:13,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-07-26 13:57:13,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 142 transitions. [2022-07-26 13:57:13,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:57:13,990 INFO L220 hiAutomatonCegarLoop]: Abstraction has 57 states and 142 transitions. [2022-07-26 13:57:13,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 142 transitions. [2022-07-26 13:57:13,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2022-07-26 13:57:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 41 states have internal predecessors, (115), 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-26 13:57:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 115 transitions. [2022-07-26 13:57:13,993 INFO L242 hiAutomatonCegarLoop]: Abstraction has 42 states and 115 transitions. [2022-07-26 13:57:13,993 INFO L426 stractBuchiCegarLoop]: Abstraction has 42 states and 115 transitions. [2022-07-26 13:57:13,993 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 13:57:13,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 115 transitions. [2022-07-26 13:57:13,994 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2022-07-26 13:57:13,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:57:13,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:57:13,994 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:57:13,994 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:57:13,995 INFO L733 eck$LassoCheckResult]: Stem: 802#[ULTIMATE.startENTRY]don't care [598] ULTIMATE.startENTRY-->L108-6: Formula: (let ((.cse1 (store |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55| 1)) (.cse0 (select |v_#memory_int_172| 1))) (and (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| v_~n~0_107) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= v_~q~0.base_108 0) (= (select .cse0 0) 48) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_27|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55|) 0) (= (select |v_#valid_207| 2) 1) (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) (= 2 (select |v_#length_178| 1)) (= v_~q~0.offset_108 0) (= (select |v_#length_178| 2) 25) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= v_~s~0_55 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1) |v_#valid_206|) (= (select |v_#valid_207| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| 0)) (< 0 |v_#StackHeapBarrier_27|) (= v_~q_back~0_176 v_~q_front~0_106) (= (select |v_#valid_207| 0) 0) (= (select .cse0 1) 0) (= |v_#NULL.offset_8| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= (store (store (store |v_#length_178| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_55| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_177|) (= |v_#NULL.base_8| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_27|, #valid=|v_#valid_207|, #memory_int=|v_#memory_int_172|, #length=|v_#length_178|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~q_back~0=v_~q_back~0_176, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_32|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ~q~0.offset=v_~q~0.offset_108, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_43|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_119|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_24|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_37|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, #length=|v_#length_177|, ~q_front~0=v_~q_front~0_106, ~s~0=v_~s~0_55, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_39|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_36|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_20|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ~q~0.base=v_~q~0.base_108, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_32|, #StackHeapBarrier=|v_#StackHeapBarrier_27|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_37|, #valid=|v_#valid_206|, #memory_int=|v_#memory_int_172|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_39|, ~n~0=v_~n~0_107, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ~q_front~0, ~s~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 804#[L108-6]don't care [582] L108-6-->L108-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|))) (and (= (select |v_#valid_174| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|) (= (store |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29| (store (select |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|)) |v_#memory_int_150|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 1)) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29| 4) (select |v_#length_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_151|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_19|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_150|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post19#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1] 814#[L108-6]don't care [596] L108-6-->L92-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre12#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= (store |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |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~pre12#1_Out_2|)) |v_#memory_int_Out_2|) (= v_~q~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~q~0.base_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_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_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~q~0.base=v_~q~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~q~0.offset=v_~q~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_2|, #valid=|v_#valid_In_7|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_2|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 776#[L92-3]don't care [456] L92-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_12|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#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~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] 756#[thread1ENTRY, L92-4]don't care [571] L92-4-->L93-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (= |v_ULTIMATE.start_main_#t~pre14#1_27| |v_#pthreadsForks_52|) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_27|)) |v_#memory_int_130|) (= (select |v_#valid_154| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_131|, #length=|v_#length_133|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_27|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_9|, #length=|v_#length_133|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 760#[thread1ENTRY, L93-3]don't care [459] L93-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_12|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 786#[thread1ENTRY, thread2ENTRY, L93-4]don't care [444] thread2ENTRY-->L65-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1] 792#[L65-2, thread1ENTRY, L93-4]don't care [2022-07-26 13:57:13,995 INFO L735 eck$LassoCheckResult]: Loop: 792#[L65-2, thread1ENTRY, L93-4]don't care [557] L65-2-->L65-2: Formula: (let ((.cse0 (* v_~q_front~0_73 4))) (let ((.cse1 (+ v_~q~0.offset_68 .cse0))) (and (<= (+ v_~q~0.offset_68 .cse0 4) (select |v_#length_105| v_~q~0.base_68)) (= (ite (and (< v_~q_front~0_73 v_~n~0_73) (< v_~q_front~0_73 v_~q_back~0_128) (<= 0 v_~q_front~0_73)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_30 |v_thread2Thread1of1ForFork1_~j~0#1_29|) v_~s~0_29) (= (select |v_#valid_126| v_~q~0.base_68) 1) (= (select (select |v_#memory_int_100| v_~q~0.base_68) .cse1) |v_thread2Thread1of1ForFork1_~j~0#1_29|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_29| 0)) (<= 0 .cse1) (= (+ v_~q_front~0_73 1) v_~q_front~0_72)))) InVars {~q_back~0=v_~q_back~0_128, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_100|, #length=|v_#length_105|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_73, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_30, ~q_front~0=v_~q_front~0_73} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_29|, ~q_back~0=v_~q_back~0_128, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_17|, ~q~0.base=v_~q~0.base_68, ~q~0.offset=v_~q~0.offset_68, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_17|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_100|, #length=|v_#length_105|, ~n~0=v_~n~0_73, ~s~0=v_~s~0_29, ~q_front~0=v_~q_front~0_72} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] 792#[L65-2, thread1ENTRY, L93-4]don't care [2022-07-26 13:57:13,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:13,995 INFO L85 PathProgramCache]: Analyzing trace with hash -59069817, now seen corresponding path program 1 times [2022-07-26 13:57:13,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:13,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278526824] [2022-07-26 13:57:13,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:14,014 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:14,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:14,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:14,042 INFO L85 PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 1 times [2022-07-26 13:57:14,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:14,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260299962] [2022-07-26 13:57:14,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:14,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:14,046 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:14,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:14,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:14,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1831163770, now seen corresponding path program 1 times [2022-07-26 13:57:14,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:14,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767421403] [2022-07-26 13:57:14,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:14,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:14,076 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-26 13:57:14,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:57:14,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767421403] [2022-07-26 13:57:14,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767421403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:57:14,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:57:14,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-26 13:57:14,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617155913] [2022-07-26 13:57:14,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:57:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:57:14,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 13:57:14,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 13:57:14,134 INFO L87 Difference]: Start difference. First operand 42 states and 115 transitions. cyclomatic complexity: 88 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:57:14,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:57:14,163 INFO L93 Difference]: Finished difference Result 52 states and 129 transitions. [2022-07-26 13:57:14,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 129 transitions. [2022-07-26 13:57:14,165 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2022-07-26 13:57:14,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 47 states and 118 transitions. [2022-07-26 13:57:14,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-26 13:57:14,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-26 13:57:14,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 118 transitions. [2022-07-26 13:57:14,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:57:14,168 INFO L220 hiAutomatonCegarLoop]: Abstraction has 47 states and 118 transitions. [2022-07-26 13:57:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 118 transitions. [2022-07-26 13:57:14,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-07-26 13:57:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.5106382978723403) internal successors, (118), 46 states have internal predecessors, (118), 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-26 13:57:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 118 transitions. [2022-07-26 13:57:14,174 INFO L242 hiAutomatonCegarLoop]: Abstraction has 47 states and 118 transitions. [2022-07-26 13:57:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 13:57:14,188 INFO L426 stractBuchiCegarLoop]: Abstraction has 47 states and 118 transitions. [2022-07-26 13:57:14,188 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 13:57:14,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 118 transitions. [2022-07-26 13:57:14,188 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2022-07-26 13:57:14,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:57:14,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:57:14,189 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:57:14,189 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:57:14,189 INFO L733 eck$LassoCheckResult]: Stem: 956#[ULTIMATE.startENTRY]don't care [598] ULTIMATE.startENTRY-->L108-6: Formula: (let ((.cse1 (store |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55| 1)) (.cse0 (select |v_#memory_int_172| 1))) (and (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| v_~n~0_107) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= v_~q~0.base_108 0) (= (select .cse0 0) 48) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_27|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55|) 0) (= (select |v_#valid_207| 2) 1) (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) (= 2 (select |v_#length_178| 1)) (= v_~q~0.offset_108 0) (= (select |v_#length_178| 2) 25) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= v_~s~0_55 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1) |v_#valid_206|) (= (select |v_#valid_207| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| 0)) (< 0 |v_#StackHeapBarrier_27|) (= v_~q_back~0_176 v_~q_front~0_106) (= (select |v_#valid_207| 0) 0) (= (select .cse0 1) 0) (= |v_#NULL.offset_8| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= (store (store (store |v_#length_178| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_55| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_177|) (= |v_#NULL.base_8| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_27|, #valid=|v_#valid_207|, #memory_int=|v_#memory_int_172|, #length=|v_#length_178|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~q_back~0=v_~q_back~0_176, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_32|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ~q~0.offset=v_~q~0.offset_108, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_43|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_119|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_24|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_37|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, #length=|v_#length_177|, ~q_front~0=v_~q_front~0_106, ~s~0=v_~s~0_55, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_39|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_36|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_20|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ~q~0.base=v_~q~0.base_108, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_32|, #StackHeapBarrier=|v_#StackHeapBarrier_27|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_37|, #valid=|v_#valid_206|, #memory_int=|v_#memory_int_172|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_39|, ~n~0=v_~n~0_107, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ~q_front~0, ~s~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 958#[L108-6]don't care [582] L108-6-->L108-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|))) (and (= (select |v_#valid_174| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|) (= (store |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29| (store (select |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|)) |v_#memory_int_150|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 1)) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29| 4) (select |v_#length_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_151|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_19|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_150|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post19#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1] 962#[L108-6]don't care [596] L108-6-->L92-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre12#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= (store |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |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~pre12#1_Out_2|)) |v_#memory_int_Out_2|) (= v_~q~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~q~0.base_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_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_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~q~0.base=v_~q~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~q~0.offset=v_~q~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_2|, #valid=|v_#valid_In_7|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_2|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 920#[L92-3]don't care [456] L92-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_12|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#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~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] 900#[thread1ENTRY, L92-4]don't care [433] thread1ENTRY-->L47-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 902#[L47-4, L92-4]don't care [561] L47-4-->L47-4: Formula: (let ((.cse1 (* v_~q_back~0_141 4))) (let ((.cse0 (+ v_~q~0.offset_76 .cse1))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| 0)) (<= 0 .cse0) (< |v_thread1Thread1of1ForFork0_~i~0#1_40| v_~N~0_41) (= 1 (select |v_#valid_136| v_~q~0.base_76)) (<= (+ v_~q~0.offset_76 4 .cse1) (select |v_#length_115| v_~q~0.base_76)) (= (ite (= (select (select |v_#memory_int_114| v_~q~0.base_76) .cse0) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= (ite (and (< v_~q_back~0_141 v_~n~0_81) (<= 0 v_~q_back~0_141)) 1 0) 0)) (= (+ v_~q_back~0_141 1) v_~q_back~0_140) (= |v_thread1Thread1of1ForFork0_~i~0#1_39| (+ |v_thread1Thread1of1ForFork0_~i~0#1_40| 1))))) InVars {~q_back~0=v_~q_back~0_141, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_40|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~n~0=v_~n~0_81, ~q~0.offset=v_~q~0.offset_76} OutVars{~q_back~0=v_~q_back~0_140, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_13|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~q~0.offset=v_~q~0.offset_76, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_39|, #valid=|v_#valid_136|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~n~0=v_~n~0_81} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] 964#[L47-4, L92-4]don't care [571] L92-4-->L93-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (= |v_ULTIMATE.start_main_#t~pre14#1_27| |v_#pthreadsForks_52|) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_27|)) |v_#memory_int_130|) (= (select |v_#valid_154| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_131|, #length=|v_#length_133|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_27|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_9|, #length=|v_#length_133|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 968#[L47-4, L93-3]don't care [459] L93-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_12|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 906#[thread2ENTRY, L93-4, L47-4]don't care [444] thread2ENTRY-->L65-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1] 910#[L65-2, L47-4, L93-4]don't care [2022-07-26 13:57:14,189 INFO L735 eck$LassoCheckResult]: Loop: 910#[L65-2, L47-4, L93-4]don't care [557] L65-2-->L65-2: Formula: (let ((.cse0 (* v_~q_front~0_73 4))) (let ((.cse1 (+ v_~q~0.offset_68 .cse0))) (and (<= (+ v_~q~0.offset_68 .cse0 4) (select |v_#length_105| v_~q~0.base_68)) (= (ite (and (< v_~q_front~0_73 v_~n~0_73) (< v_~q_front~0_73 v_~q_back~0_128) (<= 0 v_~q_front~0_73)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_30 |v_thread2Thread1of1ForFork1_~j~0#1_29|) v_~s~0_29) (= (select |v_#valid_126| v_~q~0.base_68) 1) (= (select (select |v_#memory_int_100| v_~q~0.base_68) .cse1) |v_thread2Thread1of1ForFork1_~j~0#1_29|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_29| 0)) (<= 0 .cse1) (= (+ v_~q_front~0_73 1) v_~q_front~0_72)))) InVars {~q_back~0=v_~q_back~0_128, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_100|, #length=|v_#length_105|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_73, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_30, ~q_front~0=v_~q_front~0_73} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_29|, ~q_back~0=v_~q_back~0_128, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_17|, ~q~0.base=v_~q~0.base_68, ~q~0.offset=v_~q~0.offset_68, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_17|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_100|, #length=|v_#length_105|, ~n~0=v_~n~0_73, ~s~0=v_~s~0_29, ~q_front~0=v_~q_front~0_72} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] 910#[L65-2, L47-4, L93-4]don't care [2022-07-26 13:57:14,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:14,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1055789785, now seen corresponding path program 1 times [2022-07-26 13:57:14,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:14,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129963321] [2022-07-26 13:57:14,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:14,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:14,203 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:14,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:14,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:14,222 INFO L85 PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 2 times [2022-07-26 13:57:14,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:14,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478329915] [2022-07-26 13:57:14,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:14,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:14,226 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:14,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:14,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:14,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1630255590, now seen corresponding path program 1 times [2022-07-26 13:57:14,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:14,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308380578] [2022-07-26 13:57:14,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:14,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:14,276 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:14,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:14,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:15,600 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:57:15,600 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:57:15,601 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:57:15,601 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:57:15,601 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:57:15,601 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:15,601 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:57:15,601 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:57:15,601 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-queue-add-2.wvr.c_BEv2_Iteration5_Lasso [2022-07-26 13:57:15,601 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:57:15,601 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:57:15,604 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:15,606 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:15,607 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,278 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,282 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,283 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,285 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,286 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,287 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,289 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,290 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,292 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,293 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,295 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,298 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,299 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,301 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,302 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,304 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,307 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,309 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,311 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,313 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,314 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,315 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,317 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,318 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,321 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,322 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,325 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,326 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,330 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,331 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,338 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,339 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,340 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,342 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,344 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,345 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,346 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,348 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,907 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:57:16,907 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:57:16,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:16,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:16,908 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-26 13:57:16,909 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-26 13:57:16,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:16,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:16,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:16,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:16,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:16,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:16,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:16,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:16,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:16,935 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-26 13:57:16,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:16,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:16,936 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-26 13:57:16,936 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-26 13:57:16,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:16,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:16,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:16,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:16,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:16,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:16,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:16,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:16,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:16,971 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-26 13:57:16,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:16,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:16,972 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-26 13:57:16,972 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-26 13:57:16,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-26 13:57:16,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:16,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:16,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:16,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:16,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:16,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:17,005 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:57:17,060 INFO L443 ModelExtractionUtils]: Simplification made 30 calls to the SMT solver. [2022-07-26 13:57:17,060 INFO L444 ModelExtractionUtils]: 14 out of 43 variables were initially zero. Simplification set additionally 26 variables to zero. [2022-07-26 13:57:17,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:17,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:17,061 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-26 13:57:17,061 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-26 13:57:17,062 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:57:17,073 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 13:57:17,074 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:57:17,074 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n~0, ~q_front~0) = 1*~n~0 - 1*~q_front~0 Supporting invariants [] [2022-07-26 13:57:17,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-26 13:57:17,173 INFO L156 tatePredicateManager]: 31 out of 31 supporting invariants were superfluous and have been removed [2022-07-26 13:57:17,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:17,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 13:57:17,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:17,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 13:57:17,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:17,236 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-26 13:57:17,237 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 13:57:17,237 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 118 transitions. cyclomatic complexity: 84 Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-26 13:57:17,281 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 118 transitions. cyclomatic complexity: 84. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 91 states and 227 transitions. Complement of second has 4 states. [2022-07-26 13:57:17,281 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-26 13:57:17,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-26 13:57:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-07-26 13:57:17,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 9 letters. Loop has 1 letters. [2022-07-26 13:57:17,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:17,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 10 letters. Loop has 1 letters. [2022-07-26 13:57:17,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:17,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-26 13:57:17,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:17,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 227 transitions. [2022-07-26 13:57:17,283 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 13:57:17,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 0 states and 0 transitions. [2022-07-26 13:57:17,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-26 13:57:17,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-26 13:57:17,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-26 13:57:17,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:57:17,283 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:57:17,283 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:57:17,283 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:57:17,283 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-26 13:57:17,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-26 13:57:17,284 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 13:57:17,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-26 13:57:17,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 01:57:17 BoogieIcfgContainer [2022-07-26 13:57:17,288 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 13:57:17,288 INFO L158 Benchmark]: Toolchain (without parser) took 14008.94ms. Allocated memory was 190.8MB in the beginning and 326.1MB in the end (delta: 135.3MB). Free memory was 139.7MB in the beginning and 254.7MB in the end (delta: -115.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-07-26 13:57:17,288 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory was 156.2MB in the beginning and 156.0MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 13:57:17,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.81ms. Allocated memory is still 190.8MB. Free memory was 139.6MB in the beginning and 163.9MB in the end (delta: -24.3MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-07-26 13:57:17,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.94ms. Allocated memory is still 190.8MB. Free memory was 163.9MB in the beginning and 162.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-26 13:57:17,289 INFO L158 Benchmark]: Boogie Preprocessor took 17.24ms. Allocated memory is still 190.8MB. Free memory was 162.2MB in the beginning and 160.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 13:57:17,289 INFO L158 Benchmark]: RCFGBuilder took 562.95ms. Allocated memory is still 190.8MB. Free memory was 160.3MB in the beginning and 138.3MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-07-26 13:57:17,299 INFO L158 Benchmark]: BuchiAutomizer took 13100.03ms. Allocated memory was 190.8MB in the beginning and 326.1MB in the end (delta: 135.3MB). Free memory was 138.3MB in the beginning and 254.7MB in the end (delta: -116.3MB). Peak memory consumption was 20.2MB. Max. memory is 8.0GB. [2022-07-26 13:57:17,300 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.13ms. Allocated memory is still 190.8MB. Free memory was 156.2MB in the beginning and 156.0MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 282.81ms. Allocated memory is still 190.8MB. Free memory was 139.6MB in the beginning and 163.9MB in the end (delta: -24.3MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.94ms. Allocated memory is still 190.8MB. Free memory was 163.9MB in the beginning and 162.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.24ms. Allocated memory is still 190.8MB. Free memory was 162.2MB in the beginning and 160.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 562.95ms. Allocated memory is still 190.8MB. Free memory was 160.3MB in the beginning and 138.3MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 13100.03ms. Allocated memory was 190.8MB in the beginning and 326.1MB in the end (delta: 135.3MB). Free memory was 138.3MB in the beginning and 254.7MB in the end (delta: -116.3MB). Peak memory consumption was 20.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#length-unknown[arr] + -1 * arr + -4 * i and consists of 4 locations. One deterministic module has affine ranking function n + -1 * q_back and consists of 3 locations. One deterministic module has affine ranking function n + -1 * q_front and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 8.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 131 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 12 mSDtfsCounter, 131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital285 mio100 ax108 hnf100 lsp79 ukn76 mio100 lsp41 div124 bol100 ite100 ukn100 eq171 hnf91 smp81 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 4.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 125 PlacesBefore, 21 PlacesAfterwards, 129 TransitionsBefore, 17 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 8 FixpointIterations, 89 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 16 TrivialYvCompositions, 7 ConcurrentYvCompositions, 8 ChoiceCompositions, 137 TotalNumberOfCompositions, 668 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 626, positive: 609, positive conditional: 0, positive unconditional: 609, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 389, positive: 382, positive conditional: 0, positive unconditional: 382, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 389, positive: 377, positive conditional: 0, positive unconditional: 377, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 626, positive: 227, positive conditional: 0, positive unconditional: 227, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 389, unknown conditional: 0, unknown unconditional: 389] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 RESULT: Ultimate proved your program to be correct! [2022-07-26 13:57:17,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:17,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...