/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/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.fs.omega-petrinet-638c691-m [2022-09-29 15:00:20,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 15:00:20,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 15:00:20,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 15:00:20,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 15:00:20,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 15:00:20,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 15:00:20,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 15:00:20,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 15:00:20,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 15:00:20,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 15:00:20,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 15:00:20,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 15:00:20,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 15:00:20,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 15:00:20,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 15:00:20,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 15:00:20,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 15:00:20,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 15:00:20,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 15:00:20,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 15:00:20,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 15:00:20,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 15:00:20,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 15:00:20,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 15:00:20,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 15:00:20,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 15:00:20,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 15:00:20,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 15:00:20,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 15:00:20,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 15:00:20,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 15:00:20,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 15:00:20,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 15:00:20,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 15:00:20,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 15:00:20,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 15:00:20,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 15:00:20,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 15:00:20,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 15:00:20,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 15:00:20,413 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-09-29 15:00:20,440 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 15:00:20,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 15:00:20,440 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 15:00:20,441 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 15:00:20,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 15:00:20,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 15:00:20,442 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 15:00:20,442 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-09-29 15:00:20,442 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-09-29 15:00:20,442 INFO L138 SettingsManager]: * Use old map elimination=false [2022-09-29 15:00:20,443 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-09-29 15:00:20,443 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-09-29 15:00:20,443 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-09-29 15:00:20,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 15:00:20,444 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 15:00:20,444 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-09-29 15:00:20,444 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 15:00:20,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 15:00:20,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 15:00:20,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-09-29 15:00:20,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-09-29 15:00:20,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-09-29 15:00:20,445 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 15:00:20,445 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 15:00:20,445 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-09-29 15:00:20,445 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 15:00:20,445 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-09-29 15:00:20,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 15:00:20,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 15:00:20,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 15:00:20,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 15:00:20,447 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-09-29 15:00:20,447 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-09-29 15:00:20,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 15:00:20,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 15:00:20,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 15:00:20,703 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 15:00:20,704 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 15:00:20,705 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency1.bpl [2022-09-29 15:00:20,705 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency1.bpl' [2022-09-29 15:00:20,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 15:00:20,729 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-09-29 15:00:20,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-29 15:00:20,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-29 15:00:20,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-29 15:00:20,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,760 INFO L137 Inliner]: procedures = 3, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-09-29 15:00:20,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-29 15:00:20,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 15:00:20,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 15:00:20,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 15:00:20,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 15:00:20,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 15:00:20,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 15:00:20,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 15:00:20,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/1) ... [2022-09-29 15:00:20,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:20,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:20,813 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-09-29 15:00:20,829 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-09-29 15:00:20,855 INFO L124 BoogieDeclarations]: Specification and implementation of procedure reader given in one single declaration [2022-09-29 15:00:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-09-29 15:00:20,856 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-09-29 15:00:20,856 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-09-29 15:00:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 15:00:20,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 15:00:20,856 INFO L124 BoogieDeclarations]: Specification and implementation of procedure writer given in one single declaration [2022-09-29 15:00:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-09-29 15:00:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-09-29 15:00:20,857 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-29 15:00:20,901 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 15:00:20,902 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 15:00:20,981 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 15:00:20,988 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 15:00:20,988 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-29 15:00:20,990 INFO L202 PluginConnector]: Adding new model optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 03:00:20 BoogieIcfgContainer [2022-09-29 15:00:20,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 15:00:20,991 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-09-29 15:00:20,991 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-09-29 15:00:20,995 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-09-29 15:00:20,996 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 15:00:20,996 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 03:00:20" (1/2) ... [2022-09-29 15:00:20,997 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76a24ceb and model type optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.09 03:00:20, skipping insertion in model container [2022-09-29 15:00:20,997 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 15:00:20,997 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 03:00:20" (2/2) ... [2022-09-29 15:00:20,998 INFO L322 chiAutomizerObserver]: Analyzing ICFG optimistic-concurrency1.bpl [2022-09-29 15:00:21,113 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2022-09-29 15:00:21,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 44 transitions, 118 flow [2022-09-29 15:00:21,195 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 15:00:21,196 INFO L123 PetriNetUnfolderBase]: 4/36 cut-off events. [2022-09-29 15:00:21,196 INFO L124 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2022-09-29 15:00:21,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 4/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2022-09-29 15:00:21,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 44 transitions, 118 flow [2022-09-29 15:00:21,204 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 36 transitions, 90 flow [2022-09-29 15:00:21,208 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 15:00:21,221 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 36 transitions, 90 flow [2022-09-29 15:00:21,223 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 36 transitions, 90 flow [2022-09-29 15:00:21,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 90 flow [2022-09-29 15:00:21,253 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 15:00:21,254 INFO L123 PetriNetUnfolderBase]: 4/36 cut-off events. [2022-09-29 15:00:21,254 INFO L124 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2022-09-29 15:00:21,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 4/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2022-09-29 15:00:21,256 INFO L116 LiptonReduction]: Number of co-enabled transitions 158 [2022-09-29 15:00:21,745 INFO L131 LiptonReduction]: Checked pairs total: 127 [2022-09-29 15:00:21,745 INFO L133 LiptonReduction]: Total number of compositions: 18 [2022-09-29 15:00:21,764 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 15:00:21,764 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 15:00:21,764 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 15:00:21,765 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 15:00:21,765 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 15:00:21,765 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 15:00:21,765 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 15:00:21,765 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-09-29 15:00:21,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-09-29 15:00:21,801 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-09-29 15:00:21,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:21,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:21,806 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-09-29 15:00:21,806 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:21,806 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 15:00:21,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 28 states, but on-demand construction may add more states [2022-09-29 15:00:21,809 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-09-29 15:00:21,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:21,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:21,810 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-09-29 15:00:21,810 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:21,814 INFO L733 eck$LassoCheckResult]: Stem: 48#[ULTIMATE.startENTRY]don't care [119] ULTIMATE.startENTRY-->L59: Formula: (and (<= v_ULTIMATE.start_max2_10 v_N_16) (<= 0 v_ULTIMATE.start_min1_8) (<= v_ULTIMATE.start_max1_8 v_N_16) (<= 0 v_ULTIMATE.start_min2_10)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_8, ULTIMATE.start_max2=v_ULTIMATE.start_max2_10, N=v_N_16, ULTIMATE.start_min1=v_ULTIMATE.start_min1_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_10} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_8, ULTIMATE.start_max2=v_ULTIMATE.start_max2_10, N=v_N_16, ULTIMATE.start_min1=v_ULTIMATE.start_min1_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_10} AuxVars[] AssignedVars[] 51#[L59]don't care [99] L59-->writerENTRY: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] 53#[L59-1, writerENTRY]don't care [84] writerENTRY-->L41-1: Formula: (= v_writerThread1of1ForFork2_j_1 v_writerThread1of1ForFork2_start_1) InVars {writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_1, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork2_j] 55#[L59-1, L41-1]don't care [2022-09-29 15:00:21,814 INFO L735 eck$LassoCheckResult]: Loop: 55#[L59-1, L41-1]don't care [121] L41-1-->L41-1: Formula: (and (= (+ v_writerThread1of1ForFork2_j_30 1) v_writerThread1of1ForFork2_j_29) (<= v_writerThread1of1ForFork2_j_30 v_N_20) (< v_writerThread1of1ForFork2_j_30 v_writerThread1of1ForFork2_end_11) (<= 0 v_writerThread1of1ForFork2_j_30) (= v_A_22 (store v_A_23 v_writerThread1of1ForFork2_j_30 0))) InVars {A=v_A_23, N=v_N_20, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_30, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_11} OutVars{A=v_A_22, N=v_N_20, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_29, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_11} AuxVars[] AssignedVars[A, writerThread1of1ForFork2_j] 55#[L59-1, L41-1]don't care [2022-09-29 15:00:21,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash 147303, now seen corresponding path program 1 times [2022-09-29 15:00:21,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:21,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770993750] [2022-09-29 15:00:21,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:21,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:21,884 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:21,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:21,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:21,906 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 1 times [2022-09-29 15:00:21,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:21,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436572765] [2022-09-29 15:00:21,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:21,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:21,921 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:21,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:21,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:21,934 INFO L85 PathProgramCache]: Analyzing trace with hash 4566514, now seen corresponding path program 1 times [2022-09-29 15:00:21,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:21,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581202442] [2022-09-29 15:00:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:21,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:21,953 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:21,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:22,123 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:00:22,124 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:00:22,124 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:00:22,124 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:00:22,124 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:00:22,124 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,125 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:00:22,125 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:00:22,125 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_BEv2_Iteration1_Lasso [2022-09-29 15:00:22,125 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:00:22,125 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:00:22,137 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,186 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,189 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,283 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:00:22,286 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:00:22,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,289 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-09-29 15:00:22,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-09-29 15:00:22,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:22,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-09-29 15:00:22,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:22,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:22,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:22,304 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-09-29 15:00:22,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-09-29 15:00:22,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-09-29 15:00:22,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:22,347 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-09-29 15:00:22,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,349 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-09-29 15:00:22,355 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-09-29 15:00:22,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-09-29 15:00:22,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:22,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:22,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:22,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:22,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:22,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:22,399 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:00:22,420 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-09-29 15:00:22,421 INFO L444 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-09-29 15:00:22,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:22,428 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-09-29 15:00:22,431 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-09-29 15:00:22,435 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:00:22,445 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 15:00:22,445 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:00:22,446 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(writerThread1of1ForFork2_j, writerThread1of1ForFork2_end) = -1*writerThread1of1ForFork2_j + 1*writerThread1of1ForFork2_end Supporting invariants [] [2022-09-29 15:00:22,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-09-29 15:00:22,470 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 15:00:22,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:22,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:00:22,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:22,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2022-09-29 15:00:22,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 15:00:22,573 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-09-29 15:00:22,577 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 28 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:22,647 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 28 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 66 states and 142 transitions. Complement of second has 4 states. [2022-09-29 15:00:22,649 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-09-29 15:00:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-09-29 15:00:22,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 3 letters. Loop has 1 letters. [2022-09-29 15:00:22,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:22,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 4 letters. Loop has 1 letters. [2022-09-29 15:00:22,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:22,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 3 letters. Loop has 2 letters. [2022-09-29 15:00:22,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:22,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 142 transitions. [2022-09-29 15:00:22,672 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2022-09-29 15:00:22,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 36 states and 79 transitions. [2022-09-29 15:00:22,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-09-29 15:00:22,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-09-29 15:00:22,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 79 transitions. [2022-09-29 15:00:22,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-09-29 15:00:22,681 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 79 transitions. [2022-09-29 15:00:22,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 79 transitions. [2022-09-29 15:00:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-09-29 15:00:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 30 states have internal predecessors, (69), 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-09-29 15:00:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 69 transitions. [2022-09-29 15:00:22,711 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 69 transitions. [2022-09-29 15:00:22,711 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 69 transitions. [2022-09-29 15:00:22,711 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-09-29 15:00:22,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 69 transitions. [2022-09-29 15:00:22,714 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2022-09-29 15:00:22,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:22,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:22,715 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-09-29 15:00:22,715 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:22,715 INFO L733 eck$LassoCheckResult]: Stem: 209#[ULTIMATE.startENTRY]don't care [119] ULTIMATE.startENTRY-->L59: Formula: (and (<= v_ULTIMATE.start_max2_10 v_N_16) (<= 0 v_ULTIMATE.start_min1_8) (<= v_ULTIMATE.start_max1_8 v_N_16) (<= 0 v_ULTIMATE.start_min2_10)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_8, ULTIMATE.start_max2=v_ULTIMATE.start_max2_10, N=v_N_16, ULTIMATE.start_min1=v_ULTIMATE.start_min1_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_10} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_8, ULTIMATE.start_max2=v_ULTIMATE.start_max2_10, N=v_N_16, ULTIMATE.start_min1=v_ULTIMATE.start_min1_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_10} AuxVars[] AssignedVars[] 211#[L59]don't care [99] L59-->writerENTRY: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] 241#[L59-1, writerENTRY]don't care [93] L59-1-->readerENTRY: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_2 2) (= v_readerThread1of1ForFork0_thidvar1_2 2) (= v_readerThread1of1ForFork0_start_4 v_ULTIMATE.start_min2_5) (= v_readerThread1of1ForFork0_end_6 v_ULTIMATE.start_max2_5)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_4, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_8, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_18, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork0_start, readerThread1of1ForFork0_sum, readerThread1of1ForFork0_i, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_end] 213#[L60, writerENTRY, readerENTRY]don't care [110] readerENTRY-->L28-1: Formula: (and (= v_readerThread1of1ForFork0_i_25 v_readerThread1of1ForFork0_start_5) (= v_readerThread1of1ForFork0_sum_13 0)) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5} OutVars{readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_25, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_13} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 217#[L60, L28-1, writerENTRY]don't care [2022-09-29 15:00:22,715 INFO L735 eck$LassoCheckResult]: Loop: 217#[L60, L28-1, writerENTRY]don't care [120] L28-1-->L28-1: Formula: (and (<= v_readerThread1of1ForFork0_i_36 v_N_18) (<= 0 v_readerThread1of1ForFork0_i_36) (< v_readerThread1of1ForFork0_i_36 v_readerThread1of1ForFork0_end_13) (= (+ (select v_A_20 v_readerThread1of1ForFork0_i_36) v_readerThread1of1ForFork0_sum_28) v_readerThread1of1ForFork0_sum_27) (= v_readerThread1of1ForFork0_i_35 (+ v_readerThread1of1ForFork0_i_36 1))) InVars {A=v_A_20, N=v_N_18, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_36, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_28, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_13} OutVars{A=v_A_20, N=v_N_18, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_35, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_27, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_13} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 217#[L60, L28-1, writerENTRY]don't care [2022-09-29 15:00:22,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:22,716 INFO L85 PathProgramCache]: Analyzing trace with hash 4566782, now seen corresponding path program 1 times [2022-09-29 15:00:22,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:22,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094595750] [2022-09-29 15:00:22,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:22,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,724 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:22,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:22,729 INFO L85 PathProgramCache]: Analyzing trace with hash 151, now seen corresponding path program 1 times [2022-09-29 15:00:22,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:22,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505615093] [2022-09-29 15:00:22,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:22,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,735 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:22,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash 141570362, now seen corresponding path program 1 times [2022-09-29 15:00:22,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:22,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339314517] [2022-09-29 15:00:22,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:22,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,749 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:22,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:22,884 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:00:22,884 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:00:22,884 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:00:22,885 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:00:22,885 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:00:22,885 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:22,885 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:00:22,885 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:00:22,885 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_BEv2_Iteration2_Lasso [2022-09-29 15:00:22,885 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:00:22,885 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:00:22,888 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,891 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,893 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,897 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,899 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:22,922 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:23,027 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:00:23,027 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:00:23,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:23,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:23,032 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-09-29 15:00:23,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-09-29 15:00:23,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:23,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-09-29 15:00:23,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:23,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:23,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:23,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-09-29 15:00:23,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-09-29 15:00:23,050 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-09-29 15:00:23,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:23,090 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-09-29 15:00:23,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:23,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:23,092 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-09-29 15:00:23,094 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-09-29 15:00:23,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-09-29 15:00:23,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:23,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:23,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:23,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:23,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:23,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:23,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:23,154 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-09-29 15:00:23,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:23,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:23,158 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-09-29 15:00:23,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-09-29 15:00:23,176 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-09-29 15:00:23,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:23,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:23,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:23,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:23,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:23,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:23,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:23,207 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-09-29 15:00:23,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:23,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:23,208 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-09-29 15:00:23,209 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-09-29 15:00:23,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-09-29 15:00:23,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:23,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:23,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:23,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:23,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:23,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:23,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-09-29 15:00:23,266 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-09-29 15:00:23,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:23,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:23,268 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-09-29 15:00:23,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-09-29 15:00:23,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:23,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:23,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:23,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:23,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:23,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:23,296 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-09-29 15:00:23,302 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:00:23,324 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-09-29 15:00:23,324 INFO L444 ModelExtractionUtils]: 8 out of 28 variables were initially zero. Simplification set additionally 17 variables to zero. [2022-09-29 15:00:23,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:23,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:23,360 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-09-29 15:00:23,362 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-09-29 15:00:23,363 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:00:23,392 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-09-29 15:00:23,392 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:00:23,392 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(readerThread1of1ForFork0_i, readerThread1of1ForFork0_end) = -1*readerThread1of1ForFork0_i + 1*readerThread1of1ForFork0_end Supporting invariants [] [2022-09-29 15:00:23,414 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-09-29 15:00:23,415 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-09-29 15:00:23,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:23,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:00:23,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:23,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-09-29 15:00:23,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 15:00:23,450 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-09-29 15:00:23,450 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 69 transitions. cyclomatic complexity: 47 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:23,491 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 69 transitions. cyclomatic complexity: 47. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 66 states and 155 transitions. Complement of second has 4 states. [2022-09-29 15:00:23,491 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-09-29 15:00:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-09-29 15:00:23,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 4 letters. Loop has 1 letters. [2022-09-29 15:00:23,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:23,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 5 letters. Loop has 1 letters. [2022-09-29 15:00:23,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:23,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 4 letters. Loop has 2 letters. [2022-09-29 15:00:23,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:23,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 155 transitions. [2022-09-29 15:00:23,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-09-29 15:00:23,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 51 states and 118 transitions. [2022-09-29 15:00:23,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-09-29 15:00:23,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-09-29 15:00:23,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 118 transitions. [2022-09-29 15:00:23,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-09-29 15:00:23,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 118 transitions. [2022-09-29 15:00:23,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 118 transitions. [2022-09-29 15:00:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2022-09-29 15:00:23,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.357142857142857) internal successors, (99), 41 states have internal predecessors, (99), 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-09-29 15:00:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 99 transitions. [2022-09-29 15:00:23,514 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 99 transitions. [2022-09-29 15:00:23,514 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 99 transitions. [2022-09-29 15:00:23,514 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-09-29 15:00:23,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 99 transitions. [2022-09-29 15:00:23,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-09-29 15:00:23,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:23,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:23,521 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-29 15:00:23,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:23,521 INFO L733 eck$LassoCheckResult]: Stem: 370#[ULTIMATE.startENTRY]don't care [119] ULTIMATE.startENTRY-->L59: Formula: (and (<= v_ULTIMATE.start_max2_10 v_N_16) (<= 0 v_ULTIMATE.start_min1_8) (<= v_ULTIMATE.start_max1_8 v_N_16) (<= 0 v_ULTIMATE.start_min2_10)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_8, ULTIMATE.start_max2=v_ULTIMATE.start_max2_10, N=v_N_16, ULTIMATE.start_min1=v_ULTIMATE.start_min1_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_10} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_8, ULTIMATE.start_max2=v_ULTIMATE.start_max2_10, N=v_N_16, ULTIMATE.start_min1=v_ULTIMATE.start_min1_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_10} AuxVars[] AssignedVars[] 372#[L59]don't care [99] L59-->writerENTRY: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] 390#[L59-1, writerENTRY]don't care [84] writerENTRY-->L41-1: Formula: (= v_writerThread1of1ForFork2_j_1 v_writerThread1of1ForFork2_start_1) InVars {writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_1, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork2_j] 408#[L59-1, L41-1]don't care [107] L41-1-->writerEXIT: Formula: (not (< v_writerThread1of1ForFork2_j_17 v_writerThread1of1ForFork2_end_7)) InVars {writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_7, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_17} OutVars{writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_7, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_17} AuxVars[] AssignedVars[] 434#[writerEXIT, L59-1]don't care [93] L59-1-->readerENTRY: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_2 2) (= v_readerThread1of1ForFork0_thidvar1_2 2) (= v_readerThread1of1ForFork0_start_4 v_ULTIMATE.start_min2_5) (= v_readerThread1of1ForFork0_end_6 v_ULTIMATE.start_max2_5)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_4, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_8, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_18, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork0_start, readerThread1of1ForFork0_sum, readerThread1of1ForFork0_i, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_end] 394#[writerEXIT, L60, readerENTRY]don't care [100] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork2_thidvar0_4 1) InVars {writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_4} OutVars{writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[] 404#[L61, readerENTRY]don't care [110] readerENTRY-->L28-1: Formula: (and (= v_readerThread1of1ForFork0_i_25 v_readerThread1of1ForFork0_start_5) (= v_readerThread1of1ForFork0_sum_13 0)) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5} OutVars{readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_25, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_13} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 436#[L61, L28-1]don't care [106] L28-1-->readerEXIT: Formula: (not (< v_readerThread1of1ForFork0_i_19 v_readerThread1of1ForFork0_end_7)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_19, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_7} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_19, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_7} AuxVars[] AssignedVars[] 376#[readerEXIT, L61]don't care [101] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_4 2) (= v_ULTIMATE.start_sum_2 v_readerThread1of1ForFork0_sum_10) (= v_readerThread1of1ForFork0_thidvar1_4 2)) InVars {readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_10, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_4, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_10, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_4, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] 432#[L62]don't care [63] L62-->L67: Formula: (and (<= v_ULTIMATE.start_min2_1 v_ULTIMATE.start_max1_1) (<= v_ULTIMATE.start_min1_1 v_ULTIMATE.start_max2_1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_1, ULTIMATE.start_max2=v_ULTIMATE.start_max2_1, ULTIMATE.start_min1=v_ULTIMATE.start_min1_1, ULTIMATE.start_min2=v_ULTIMATE.start_min2_1} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_1, ULTIMATE.start_max2=v_ULTIMATE.start_max2_1, ULTIMATE.start_min1=v_ULTIMATE.start_min1_1, ULTIMATE.start_min2=v_ULTIMATE.start_min2_1} AuxVars[] AssignedVars[] 366#[L67]don't care [96] L67-->readerENTRY: Formula: (and (= v_readerThread1of1ForFork1_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork1_thidvar0_2 2) (= v_ULTIMATE.start_min2_7 v_readerThread1of1ForFork1_start_4) (= v_readerThread1of1ForFork1_thidvar1_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{readerThread1of1ForFork1_thidvar0=v_readerThread1of1ForFork1_thidvar0_2, ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork1_thidvar1=v_readerThread1of1ForFork1_thidvar1_2, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_8, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_18, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_6, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_4} AuxVars[] AssignedVars[readerThread1of1ForFork1_thidvar0, readerThread1of1ForFork1_thidvar1, readerThread1of1ForFork1_sum, readerThread1of1ForFork1_i, readerThread1of1ForFork1_end, readerThread1of1ForFork1_start] 368#[L67-1, readerENTRY]don't care [105] readerENTRY-->L28-1: Formula: (and (= v_readerThread1of1ForFork1_sum_13 0) (= v_readerThread1of1ForFork1_i_19 v_readerThread1of1ForFork1_start_5)) InVars {readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_5} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_19, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_13, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_5} AuxVars[] AssignedVars[readerThread1of1ForFork1_i, readerThread1of1ForFork1_sum] 364#[L67-1, L28-1]don't care [2022-09-29 15:00:23,522 INFO L735 eck$LassoCheckResult]: Loop: 364#[L67-1, L28-1]don't care [122] L28-1-->L28-1: Formula: (and (= v_readerThread1of1ForFork1_sum_19 (+ v_readerThread1of1ForFork1_sum_20 (select v_A_26 v_readerThread1of1ForFork1_i_32))) (<= 0 v_readerThread1of1ForFork1_i_32) (= (+ v_readerThread1of1ForFork1_i_32 1) v_readerThread1of1ForFork1_i_31) (< v_readerThread1of1ForFork1_i_32 v_readerThread1of1ForFork1_end_13) (<= v_readerThread1of1ForFork1_i_32 v_N_22)) InVars {A=v_A_26, N=v_N_22, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_32, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_20, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_13} OutVars{A=v_A_26, N=v_N_22, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_31, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_19, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_13} AuxVars[] AssignedVars[readerThread1of1ForFork1_i, readerThread1of1ForFork1_sum] 364#[L67-1, L28-1]don't care [2022-09-29 15:00:23,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:23,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1605479946, now seen corresponding path program 1 times [2022-09-29 15:00:23,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:23,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114603923] [2022-09-29 15:00:23,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:23,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,541 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:23,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:23,562 INFO L85 PathProgramCache]: Analyzing trace with hash 153, now seen corresponding path program 1 times [2022-09-29 15:00:23,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:23,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684309213] [2022-09-29 15:00:23,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:23,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,574 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:23,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1769729104, now seen corresponding path program 1 times [2022-09-29 15:00:23,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:23,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192028279] [2022-09-29 15:00:23,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:23,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 15:00:23,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 15:00:23,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192028279] [2022-09-29 15:00:23,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192028279] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 15:00:23,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 15:00:23,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-29 15:00:23,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217340399] [2022-09-29 15:00:23,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 15:00:23,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 15:00:23,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-29 15:00:23,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-29 15:00:23,695 INFO L87 Difference]: Start difference. First operand 42 states and 99 transitions. cyclomatic complexity: 68 Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 15:00:23,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-29 15:00:23,855 INFO L93 Difference]: Finished difference Result 63 states and 139 transitions. [2022-09-29 15:00:23,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 139 transitions. [2022-09-29 15:00:23,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-09-29 15:00:23,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 49 states and 111 transitions. [2022-09-29 15:00:23,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-09-29 15:00:23,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-09-29 15:00:23,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 111 transitions. [2022-09-29 15:00:23,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-09-29 15:00:23,857 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 111 transitions. [2022-09-29 15:00:23,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 111 transitions. [2022-09-29 15:00:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2022-09-29 15:00:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 42 states have internal predecessors, (96), 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-09-29 15:00:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 96 transitions. [2022-09-29 15:00:23,861 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 96 transitions. [2022-09-29 15:00:23,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-29 15:00:23,863 INFO L428 stractBuchiCegarLoop]: Abstraction has 43 states and 96 transitions. [2022-09-29 15:00:23,863 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-09-29 15:00:23,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 96 transitions. [2022-09-29 15:00:23,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-09-29 15:00:23,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 15:00:23,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 15:00:23,866 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-29 15:00:23,866 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 15:00:23,867 INFO L733 eck$LassoCheckResult]: Stem: 539#[ULTIMATE.startENTRY]don't care [119] ULTIMATE.startENTRY-->L59: Formula: (and (<= v_ULTIMATE.start_max2_10 v_N_16) (<= 0 v_ULTIMATE.start_min1_8) (<= v_ULTIMATE.start_max1_8 v_N_16) (<= 0 v_ULTIMATE.start_min2_10)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_8, ULTIMATE.start_max2=v_ULTIMATE.start_max2_10, N=v_N_16, ULTIMATE.start_min1=v_ULTIMATE.start_min1_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_10} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_8, ULTIMATE.start_max2=v_ULTIMATE.start_max2_10, N=v_N_16, ULTIMATE.start_min1=v_ULTIMATE.start_min1_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_10} AuxVars[] AssignedVars[] 541#[L59]don't care [99] L59-->writerENTRY: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] 571#[L59-1, writerENTRY]don't care [84] writerENTRY-->L41-1: Formula: (= v_writerThread1of1ForFork2_j_1 v_writerThread1of1ForFork2_start_1) InVars {writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_1, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork2_j] 573#[L59-1, L41-1]don't care [107] L41-1-->writerEXIT: Formula: (not (< v_writerThread1of1ForFork2_j_17 v_writerThread1of1ForFork2_end_7)) InVars {writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_7, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_17} OutVars{writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_7, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_17} AuxVars[] AssignedVars[] 601#[writerEXIT, L59-1]don't care [93] L59-1-->readerENTRY: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_2 2) (= v_readerThread1of1ForFork0_thidvar1_2 2) (= v_readerThread1of1ForFork0_start_4 v_ULTIMATE.start_min2_5) (= v_readerThread1of1ForFork0_end_6 v_ULTIMATE.start_max2_5)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_4, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_8, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_18, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork0_start, readerThread1of1ForFork0_sum, readerThread1of1ForFork0_i, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_end] 555#[writerEXIT, L60, readerENTRY]don't care [100] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork2_thidvar0_4 1) InVars {writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_4} OutVars{writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[] 575#[L61, readerENTRY]don't care [110] readerENTRY-->L28-1: Formula: (and (= v_readerThread1of1ForFork0_i_25 v_readerThread1of1ForFork0_start_5) (= v_readerThread1of1ForFork0_sum_13 0)) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5} OutVars{readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_25, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_13} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 603#[L61, L28-1]don't care [120] L28-1-->L28-1: Formula: (and (<= v_readerThread1of1ForFork0_i_36 v_N_18) (<= 0 v_readerThread1of1ForFork0_i_36) (< v_readerThread1of1ForFork0_i_36 v_readerThread1of1ForFork0_end_13) (= (+ (select v_A_20 v_readerThread1of1ForFork0_i_36) v_readerThread1of1ForFork0_sum_28) v_readerThread1of1ForFork0_sum_27) (= v_readerThread1of1ForFork0_i_35 (+ v_readerThread1of1ForFork0_i_36 1))) InVars {A=v_A_20, N=v_N_18, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_36, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_28, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_13} OutVars{A=v_A_20, N=v_N_18, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_35, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_27, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_13} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 609#[L61, L28-1]don't care [106] L28-1-->readerEXIT: Formula: (not (< v_readerThread1of1ForFork0_i_19 v_readerThread1of1ForFork0_end_7)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_19, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_7} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_19, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_7} AuxVars[] AssignedVars[] 551#[readerEXIT, L61]don't care [101] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_4 2) (= v_ULTIMATE.start_sum_2 v_readerThread1of1ForFork0_sum_10) (= v_readerThread1of1ForFork0_thidvar1_4 2)) InVars {readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_10, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_4, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_10, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_4, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] 599#[L62]don't care [63] L62-->L67: Formula: (and (<= v_ULTIMATE.start_min2_1 v_ULTIMATE.start_max1_1) (<= v_ULTIMATE.start_min1_1 v_ULTIMATE.start_max2_1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_1, ULTIMATE.start_max2=v_ULTIMATE.start_max2_1, ULTIMATE.start_min1=v_ULTIMATE.start_min1_1, ULTIMATE.start_min2=v_ULTIMATE.start_min2_1} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_1, ULTIMATE.start_max2=v_ULTIMATE.start_max2_1, ULTIMATE.start_min1=v_ULTIMATE.start_min1_1, ULTIMATE.start_min2=v_ULTIMATE.start_min2_1} AuxVars[] AssignedVars[] 533#[L67]don't care [96] L67-->readerENTRY: Formula: (and (= v_readerThread1of1ForFork1_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork1_thidvar0_2 2) (= v_ULTIMATE.start_min2_7 v_readerThread1of1ForFork1_start_4) (= v_readerThread1of1ForFork1_thidvar1_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{readerThread1of1ForFork1_thidvar0=v_readerThread1of1ForFork1_thidvar0_2, ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork1_thidvar1=v_readerThread1of1ForFork1_thidvar1_2, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_8, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_18, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_6, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_4} AuxVars[] AssignedVars[readerThread1of1ForFork1_thidvar0, readerThread1of1ForFork1_thidvar1, readerThread1of1ForFork1_sum, readerThread1of1ForFork1_i, readerThread1of1ForFork1_end, readerThread1of1ForFork1_start] 535#[L67-1, readerENTRY]don't care [105] readerENTRY-->L28-1: Formula: (and (= v_readerThread1of1ForFork1_sum_13 0) (= v_readerThread1of1ForFork1_i_19 v_readerThread1of1ForFork1_start_5)) InVars {readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_5} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_19, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_13, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_5} AuxVars[] AssignedVars[readerThread1of1ForFork1_i, readerThread1of1ForFork1_sum] 537#[L67-1, L28-1]don't care [2022-09-29 15:00:23,867 INFO L735 eck$LassoCheckResult]: Loop: 537#[L67-1, L28-1]don't care [122] L28-1-->L28-1: Formula: (and (= v_readerThread1of1ForFork1_sum_19 (+ v_readerThread1of1ForFork1_sum_20 (select v_A_26 v_readerThread1of1ForFork1_i_32))) (<= 0 v_readerThread1of1ForFork1_i_32) (= (+ v_readerThread1of1ForFork1_i_32 1) v_readerThread1of1ForFork1_i_31) (< v_readerThread1of1ForFork1_i_32 v_readerThread1of1ForFork1_end_13) (<= v_readerThread1of1ForFork1_i_32 v_N_22)) InVars {A=v_A_26, N=v_N_22, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_32, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_20, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_13} OutVars{A=v_A_26, N=v_N_22, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_31, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_19, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_13} AuxVars[] AssignedVars[readerThread1of1ForFork1_i, readerThread1of1ForFork1_sum] 537#[L67-1, L28-1]don't care [2022-09-29 15:00:23,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:23,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1363203336, now seen corresponding path program 1 times [2022-09-29 15:00:23,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:23,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314355257] [2022-09-29 15:00:23,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:23,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,901 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:23,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:23,919 INFO L85 PathProgramCache]: Analyzing trace with hash 153, now seen corresponding path program 2 times [2022-09-29 15:00:23,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:23,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58919956] [2022-09-29 15:00:23,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:23,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,922 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:23,930 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-09-29 15:00:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:23,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:23,938 INFO L85 PathProgramCache]: Analyzing trace with hash 690369666, now seen corresponding path program 1 times [2022-09-29 15:00:23,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 15:00:23,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657504454] [2022-09-29 15:00:23,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 15:00:23,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 15:00:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,962 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 15:00:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 15:00:23,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 15:00:23,995 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-09-29 15:00:24,271 INFO L210 LassoAnalysis]: Preferences: [2022-09-29 15:00:24,271 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-09-29 15:00:24,272 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-09-29 15:00:24,272 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-09-29 15:00:24,272 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-09-29 15:00:24,272 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:24,272 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-09-29 15:00:24,272 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-09-29 15:00:24,272 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_BEv2_Iteration4_Lasso [2022-09-29 15:00:24,272 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-09-29 15:00:24,272 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-09-29 15:00:24,274 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:24,360 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:24,363 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:24,365 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:24,368 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:24,370 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-09-29 15:00:24,540 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-09-29 15:00:24,541 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-09-29 15:00:24,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:24,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:24,542 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-09-29 15:00:24,545 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-09-29 15:00:24,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-09-29 15:00:24,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-09-29 15:00:24,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-09-29 15:00:24,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-09-29 15:00:24,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-09-29 15:00:24,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-09-29 15:00:24,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-09-29 15:00:24,583 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-09-29 15:00:24,605 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-09-29 15:00:24,605 INFO L444 ModelExtractionUtils]: 12 out of 46 variables were initially zero. Simplification set additionally 29 variables to zero. [2022-09-29 15:00:24,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 15:00:24,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 15:00:24,608 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-09-29 15:00:24,609 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-09-29 15:00:24,610 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-09-29 15:00:24,638 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-09-29 15:00:24,639 INFO L513 LassoAnalysis]: Proved termination. [2022-09-29 15:00:24,639 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(readerThread1of1ForFork1_i, N) = -2*readerThread1of1ForFork1_i + 3*N Supporting invariants [1*N - 1 >= 0] [2022-09-29 15:00:24,655 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-09-29 15:00:24,658 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-09-29 15:00:24,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 15:00:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:24,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2022-09-29 15:00:24,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 15:00:24,700 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2022-09-29 15:00:24,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 15:00:24,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 15:00:24,701 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-09-29 15:00:24,702 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 96 transitions. cyclomatic complexity: 64 Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-09-29 15:00:24,716 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 96 transitions. cyclomatic complexity: 64. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 44 states and 97 transitions. Complement of second has 2 states. [2022-09-29 15:00:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-09-29 15:00:24,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-09-29 15:00:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 15 transitions. [2022-09-29 15:00:24,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 13 letters. Loop has 1 letters. [2022-09-29 15:00:24,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:24,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 14 letters. Loop has 1 letters. [2022-09-29 15:00:24,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:24,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 13 letters. Loop has 2 letters. [2022-09-29 15:00:24,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-09-29 15:00:24,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 97 transitions. [2022-09-29 15:00:24,719 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-09-29 15:00:24,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2022-09-29 15:00:24,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-09-29 15:00:24,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-09-29 15:00:24,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-09-29 15:00:24,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-29 15:00:24,720 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-09-29 15:00:24,720 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-09-29 15:00:24,720 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-09-29 15:00:24,720 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-09-29 15:00:24,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-09-29 15:00:24,720 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-09-29 15:00:24,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-09-29 15:00:24,726 INFO L202 PluginConnector]: Adding new model optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.09 03:00:24 BoogieIcfgContainer [2022-09-29 15:00:24,726 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-09-29 15:00:24,726 INFO L158 Benchmark]: Toolchain (without parser) took 3996.96ms. Allocated memory was 184.5MB in the beginning and 235.9MB in the end (delta: 51.4MB). Free memory was 136.7MB in the beginning and 141.4MB in the end (delta: -4.6MB). Peak memory consumption was 48.3MB. Max. memory is 8.0GB. [2022-09-29 15:00:24,726 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 15:00:24,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.37ms. Allocated memory is still 184.5MB. Free memory was 136.7MB in the beginning and 135.2MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-29 15:00:24,727 INFO L158 Benchmark]: Boogie Preprocessor took 12.81ms. Allocated memory is still 184.5MB. Free memory was 135.1MB in the beginning and 134.2MB in the end (delta: 906.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-29 15:00:24,728 INFO L158 Benchmark]: RCFGBuilder took 214.50ms. Allocated memory is still 184.5MB. Free memory was 134.2MB in the beginning and 125.2MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-09-29 15:00:24,728 INFO L158 Benchmark]: BuchiAutomizer took 3734.38ms. Allocated memory was 184.5MB in the beginning and 235.9MB in the end (delta: 51.4MB). Free memory was 125.0MB in the beginning and 141.4MB in the end (delta: -16.3MB). Peak memory consumption was 34.7MB. Max. memory is 8.0GB. [2022-09-29 15:00:24,729 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.37ms. Allocated memory is still 184.5MB. Free memory was 136.7MB in the beginning and 135.2MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.81ms. Allocated memory is still 184.5MB. Free memory was 135.1MB in the beginning and 134.2MB in the end (delta: 906.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 214.50ms. Allocated memory is still 184.5MB. Free memory was 134.2MB in the beginning and 125.2MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3734.38ms. Allocated memory was 184.5MB in the beginning and 235.9MB in the end (delta: 51.4MB). Free memory was 125.0MB in the beginning and 141.4MB in the end (delta: -16.3MB). Peak memory consumption was 34.7MB. 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 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function end + -1 * j and consists of 3 locations. One deterministic module has affine ranking function end + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 3 * N and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 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, 89 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 12 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital72 mio100 ax100 hnf100 lsp83 ukn91 mio100 lsp87 div100 bol100 ite100 ukn100 eq158 hnf91 smp100 dnf100 smp100 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 97ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.6s - 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: 0.5s, 42 PlacesBefore, 27 PlacesAfterwards, 36 TransitionsBefore, 21 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 2 FixpointIterations, 7 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 18 TotalNumberOfCompositions, 127 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 124, positive: 122, positive conditional: 0, positive unconditional: 122, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 96, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 96, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 96, unknown conditional: 0, unknown unconditional: 96] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2022-09-29 15:00:24,757 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-09-29 15:00:24,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...