/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/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:12:23,976 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:12:24,018 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:12:24,044 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:12:24,045 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:12:24,045 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:12:24,047 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:12:24,047 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:12:24,047 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:12:24,050 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:12:24,050 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:12:24,050 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:12:24,051 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:12:24,051 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:12:24,052 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:12:24,052 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:12:24,052 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:12:24,052 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:12:24,053 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:12:24,053 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:12:24,054 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:12:24,054 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:12:24,054 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:12:24,054 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:12:24,054 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:12:24,054 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:12:24,055 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:12:24,055 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:12:24,055 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:12:24,055 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:12:24,056 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:12:24,056 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:12:24,056 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:12:24,057 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:12:24,057 INFO L137 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_AUTOMATON [2023-10-12 17:12:24,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:12:24,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:12:24,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:12:24,293 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:12:24,296 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:12:24,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update3.bpl [2023-10-12 17:12:24,298 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update3.bpl' [2023-10-12 17:12:24,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:12:24,323 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:12:24,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:24,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:12:24,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:12:24,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:24" (1/1) ... [2023-10-12 17:12:24,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:24" (1/1) ... [2023-10-12 17:12:24,342 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:12:24,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:24,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:12:24,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:12:24,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:12:24,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:24" (1/1) ... [2023-10-12 17:12:24,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:24" (1/1) ... [2023-10-12 17:12:24,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:24" (1/1) ... [2023-10-12 17:12:24,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:24" (1/1) ... [2023-10-12 17:12:24,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:24" (1/1) ... [2023-10-12 17:12:24,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:24" (1/1) ... [2023-10-12 17:12:24,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:24" (1/1) ... [2023-10-12 17:12:24,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:24" (1/1) ... [2023-10-12 17:12:24,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:12:24,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:12:24,368 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:12:24,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:12:24,369 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:24" (1/1) ... [2023-10-12 17:12:24,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:24,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:24,395 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) [2023-10-12 17:12:24,404 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 [2023-10-12 17:12:24,424 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:12:24,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:12:24,426 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:12:24,427 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:12:24,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:12:24,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:12:24,428 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:12:24,428 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:12:24,428 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:12:24,428 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:12:24,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:12:24,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:12:24,429 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:12:24,467 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:12:24,468 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:12:24,578 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:12:24,583 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:12:24,583 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:12:24,584 INFO L201 PluginConnector]: Adding new model map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:24 BoogieIcfgContainer [2023-10-12 17:12:24,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:12:24,585 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:12:24,585 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:12:24,595 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:12:24,595 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:24,596 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:24" (1/2) ... [2023-10-12 17:12:24,597 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50a4e6b1 and model type map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:12:24, skipping insertion in model container [2023-10-12 17:12:24,597 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:24,597 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:24" (2/2) ... [2023-10-12 17:12:24,598 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-aggr-update3.bpl [2023-10-12 17:12:24,675 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:12:24,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 104 flow [2023-10-12 17:12:24,710 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2023-10-12 17:12:24,710 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:12:24,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 5/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2023-10-12 17:12:24,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 40 transitions, 104 flow [2023-10-12 17:12:24,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 86 flow [2023-10-12 17:12:24,720 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:12:24,729 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 86 flow [2023-10-12 17:12:24,731 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 86 flow [2023-10-12 17:12:24,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 86 flow [2023-10-12 17:12:24,738 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2023-10-12 17:12:24,738 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:12:24,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 5/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2023-10-12 17:12:24,742 INFO L119 LiptonReduction]: Number of co-enabled transitions 456 [2023-10-12 17:12:25,192 INFO L134 LiptonReduction]: Checked pairs total: 360 [2023-10-12 17:12:25,192 INFO L136 LiptonReduction]: Total number of compositions: 18 [2023-10-12 17:12:25,207 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:12:25,207 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:12:25,207 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:12:25,207 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:12:25,207 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:12:25,207 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:12:25,207 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:12:25,208 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:12:25,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:12:25,240 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2023-10-12 17:12:25,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:25,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:25,245 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:12:25,245 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:25,245 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:12:25,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 55 states, but on-demand construction may add more states [2023-10-12 17:12:25,249 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2023-10-12 17:12:25,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:25,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:25,250 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:12:25,250 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:25,253 INFO L748 eck$LassoCheckResult]: Stem: 45#[$Ultimate##0]don't care [83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 48#[L34]don't care [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 50#[$Ultimate##0, L34-1]don't care [88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 54#[L34-1, L51-1]don't care [2023-10-12 17:12:25,254 INFO L750 eck$LassoCheckResult]: Loop: 54#[L34-1, L51-1]don't care [137] L51-1-->L51-1: Formula: (and (= v_thread1Thread1of1ForFork0_i_25 (+ v_thread1Thread1of1ForFork0_i_26 1)) (= (store v_A_32 v_thread1Thread1of1ForFork0_i_26 (let ((.cse0 (select v_A_32 v_thread1Thread1of1ForFork0_i_26))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_31) (< v_thread1Thread1of1ForFork0_i_26 v_N_28)) InVars {A=v_A_32, N=v_N_28, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_26} OutVars{A=v_A_31, N=v_N_28, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_25} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork0_i] 54#[L34-1, L51-1]don't care [2023-10-12 17:12:25,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:25,257 INFO L85 PathProgramCache]: Analyzing trace with hash 113176, now seen corresponding path program 1 times [2023-10-12 17:12:25,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:25,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165544204] [2023-10-12 17:12:25,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:25,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:25,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:25,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:25,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:25,355 INFO L85 PathProgramCache]: Analyzing trace with hash 168, now seen corresponding path program 1 times [2023-10-12 17:12:25,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:25,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685879785] [2023-10-12 17:12:25,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:25,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:25,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:25,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:25,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:25,382 INFO L85 PathProgramCache]: Analyzing trace with hash 3508593, now seen corresponding path program 1 times [2023-10-12 17:12:25,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:25,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213829400] [2023-10-12 17:12:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:25,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:25,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:25,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:25,495 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:25,496 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:25,496 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:25,496 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:25,496 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:25,496 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:25,496 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:25,496 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:25,496 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update3.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:12:25,496 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:25,497 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:25,507 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:25,515 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:25,569 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:25,572 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:25,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:25,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:25,576 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) [2023-10-12 17:12:25,581 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 [2023-10-12 17:12:25,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:12:25,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:25,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:25,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:25,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:25,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:25,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:25,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:25,611 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 [2023-10-12 17:12:25,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:25,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:25,613 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) [2023-10-12 17:12:25,616 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 [2023-10-12 17:12:25,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:12:25,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:25,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:25,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:25,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:25,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:25,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:25,644 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:25,652 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:12:25,653 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:12:25,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:25,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:25,659 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) [2023-10-12 17:12:25,660 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 [2023-10-12 17:12:25,661 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:25,687 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:25,687 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:25,688 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2023-10-12 17:12:25,696 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 [2023-10-12 17:12:25,699 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:25,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:25,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:25,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:25,747 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:25,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:25,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:25,765 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 [2023-10-12 17:12:25,767 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 55 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) [2023-10-12 17:12:25,822 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 55 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 144 states and 490 transitions. Complement of second has 4 states. [2023-10-12 17:12:25,824 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 [2023-10-12 17:12:25,828 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) [2023-10-12 17:12:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2023-10-12 17:12:25,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:12:25,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:25,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:12:25,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:25,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:12:25,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:25,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 490 transitions. [2023-10-12 17:12:25,848 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2023-10-12 17:12:25,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 103 states and 354 transitions. [2023-10-12 17:12:25,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2023-10-12 17:12:25,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2023-10-12 17:12:25,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 354 transitions. [2023-10-12 17:12:25,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:25,854 INFO L219 hiAutomatonCegarLoop]: Abstraction has 103 states and 354 transitions. [2023-10-12 17:12:25,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 354 transitions. [2023-10-12 17:12:25,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2023-10-12 17:12:25,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 3.5853658536585367) internal successors, (294), 81 states have internal predecessors, (294), 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) [2023-10-12 17:12:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 294 transitions. [2023-10-12 17:12:25,887 INFO L241 hiAutomatonCegarLoop]: Abstraction has 82 states and 294 transitions. [2023-10-12 17:12:25,887 INFO L430 stractBuchiCegarLoop]: Abstraction has 82 states and 294 transitions. [2023-10-12 17:12:25,887 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:12:25,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 294 transitions. [2023-10-12 17:12:25,888 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2023-10-12 17:12:25,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:25,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:25,889 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:12:25,889 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:25,889 INFO L748 eck$LassoCheckResult]: Stem: 480#[$Ultimate##0]don't care [83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 476#[L34]don't care [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 394#[$Ultimate##0, L34-1]don't care [117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] 386#[$Ultimate##0, L35, $Ultimate##0]don't care [134] $Ultimate##0-->L65-1: Formula: (and (= (+ v_thread2Thread1of1ForFork1_cnt_23 1) 0) (= v_thread2Thread1of1ForFork1_j_39 0)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_39, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_cnt] 332#[L35, L65-1, $Ultimate##0]don't care [2023-10-12 17:12:25,890 INFO L750 eck$LassoCheckResult]: Loop: 332#[L35, L65-1, $Ultimate##0]don't care [141] L65-1-->L65-1: Formula: (and (let ((.cse0 (= (select v_A_39 v_thread2Thread1of1ForFork1_j_60) 0)) (.cse1 (< v_thread2Thread1of1ForFork1_j_60 v_N_36))) (or (and .cse0 (= v_thread2Thread1of1ForFork1_cnt_42 (+ v_thread2Thread1of1ForFork1_cnt_43 1)) .cse1) (and (= v_thread2Thread1of1ForFork1_cnt_43 v_thread2Thread1of1ForFork1_cnt_42) (not .cse0) .cse1))) (let ((.cse2 (= v_thread2Thread1of1ForFork1_j_59 (+ v_thread2Thread1of1ForFork1_j_60 1))) (.cse3 (select v_B_29 v_thread2Thread1of1ForFork1_j_60))) (or (and .cse2 (= v_thread2Thread1of1ForFork1_cnt_42 v_thread2Thread1of1ForFork1_cnt_41) (<= .cse3 0)) (and .cse2 (< 0 .cse3) (= v_thread2Thread1of1ForFork1_cnt_41 (+ v_thread2Thread1of1ForFork1_cnt_42 1)))))) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_60, A=v_A_39, N=v_N_36, B=v_B_29, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_43} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_59, A=v_A_39, N=v_N_36, B=v_B_29, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_41} AuxVars[v_thread2Thread1of1ForFork1_cnt_42] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_cnt] 332#[L35, L65-1, $Ultimate##0]don't care [2023-10-12 17:12:25,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash 3509489, now seen corresponding path program 1 times [2023-10-12 17:12:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:25,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728033519] [2023-10-12 17:12:25,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:25,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:25,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:25,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:25,898 INFO L85 PathProgramCache]: Analyzing trace with hash 172, now seen corresponding path program 1 times [2023-10-12 17:12:25,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:25,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961196351] [2023-10-12 17:12:25,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:25,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:25,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:25,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:25,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:25,910 INFO L85 PathProgramCache]: Analyzing trace with hash 108794300, now seen corresponding path program 1 times [2023-10-12 17:12:25,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:25,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512203402] [2023-10-12 17:12:25,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:25,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:25,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:25,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:26,091 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:26,091 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:26,091 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:26,091 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:26,091 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:26,092 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:26,092 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:26,092 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:26,092 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update3.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:12:26,092 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:26,092 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:26,097 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:26,165 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:26,168 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:26,171 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:26,173 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:26,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:12:26,421 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:26,421 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:26,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:26,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:26,422 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) [2023-10-12 17:12:26,424 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 [2023-10-12 17:12:26,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:12:26,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:26,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:26,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:26,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:26,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:26,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:26,453 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:26,468 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:12:26,468 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:12:26,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:26,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:26,470 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) [2023-10-12 17:12:26,472 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 [2023-10-12 17:12:26,473 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:26,498 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:26,498 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:26,498 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, N) = -1*thread2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2023-10-12 17:12:26,503 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 [2023-10-12 17:12:26,504 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:26,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:26,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:26,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:26,529 WARN L260 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:26,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:26,531 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 [2023-10-12 17:12:26,531 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 294 transitions. cyclomatic complexity: 248 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) [2023-10-12 17:12:26,563 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 294 transitions. cyclomatic complexity: 248. 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 224 states and 842 transitions. Complement of second has 4 states. [2023-10-12 17:12:26,564 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 [2023-10-12 17:12:26,564 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) [2023-10-12 17:12:26,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2023-10-12 17:12:26,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:12:26,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:26,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:12:26,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:26,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:12:26,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:26,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 842 transitions. [2023-10-12 17:12:26,573 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2023-10-12 17:12:26,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 148 states and 549 transitions. [2023-10-12 17:12:26,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2023-10-12 17:12:26,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2023-10-12 17:12:26,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 549 transitions. [2023-10-12 17:12:26,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:26,579 INFO L219 hiAutomatonCegarLoop]: Abstraction has 148 states and 549 transitions. [2023-10-12 17:12:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 549 transitions. [2023-10-12 17:12:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 116. [2023-10-12 17:12:26,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 3.8189655172413794) internal successors, (443), 115 states have internal predecessors, (443), 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) [2023-10-12 17:12:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 443 transitions. [2023-10-12 17:12:26,594 INFO L241 hiAutomatonCegarLoop]: Abstraction has 116 states and 443 transitions. [2023-10-12 17:12:26,594 INFO L430 stractBuchiCegarLoop]: Abstraction has 116 states and 443 transitions. [2023-10-12 17:12:26,594 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:12:26,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 443 transitions. [2023-10-12 17:12:26,595 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2023-10-12 17:12:26,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:26,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:26,596 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:12:26,596 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:26,596 INFO L748 eck$LassoCheckResult]: Stem: 935#[$Ultimate##0]don't care [83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 927#[L34]don't care [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 827#[$Ultimate##0, L34-1]don't care [117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] 819#[$Ultimate##0, L35, $Ultimate##0]don't care [120] L35-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_12} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k] 821#[L36, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [106] $Ultimate##0-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] 899#[L36, L83-1, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:12:26,596 INFO L750 eck$LassoCheckResult]: Loop: 899#[L36, L83-1, $Ultimate##0, $Ultimate##0]don't care [138] L83-1-->L83-1: Formula: (and (= (store v_B_26 v_thread3Thread1of1ForFork2_k_24 v_thread3Thread1of1ForFork2_k_24) v_B_25) (< v_thread3Thread1of1ForFork2_k_24 v_N_32) (= v_thread3Thread1of1ForFork2_k_23 0)) InVars {N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_24, B=v_B_26} OutVars{N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_23, B=v_B_25} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k, B] 899#[L36, L83-1, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:12:26,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash 108793831, now seen corresponding path program 1 times [2023-10-12 17:12:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:26,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924723240] [2023-10-12 17:12:26,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:26,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:26,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:26,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:26,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:26,604 INFO L85 PathProgramCache]: Analyzing trace with hash 169, now seen corresponding path program 1 times [2023-10-12 17:12:26,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:26,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67451257] [2023-10-12 17:12:26,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:26,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:26,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:26,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:26,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:26,624 INFO L85 PathProgramCache]: Analyzing trace with hash -922358397, now seen corresponding path program 1 times [2023-10-12 17:12:26,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:26,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901268304] [2023-10-12 17:12:26,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:26,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:26,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:26,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:26,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:26,728 INFO L201 PluginConnector]: Adding new model map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:12:26 BoogieIcfgContainer [2023-10-12 17:12:26,729 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:12:26,729 INFO L158 Benchmark]: Toolchain (without parser) took 2406.54ms. Allocated memory was 186.6MB in the beginning and 320.9MB in the end (delta: 134.2MB). Free memory was 138.9MB in the beginning and 254.2MB in the end (delta: -115.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-10-12 17:12:26,730 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.79ms. Allocated memory is still 186.6MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:12:26,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.05ms. Allocated memory is still 186.6MB. Free memory was 138.9MB in the beginning and 137.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:12:26,730 INFO L158 Benchmark]: Boogie Preprocessor took 22.45ms. Allocated memory is still 186.6MB. Free memory was 137.3MB in the beginning and 136.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:12:26,731 INFO L158 Benchmark]: RCFGBuilder took 216.94ms. Allocated memory is still 186.6MB. Free memory was 136.1MB in the beginning and 126.0MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:12:26,731 INFO L158 Benchmark]: BuchiAutomizer took 2143.56ms. Allocated memory was 186.6MB in the beginning and 320.9MB in the end (delta: 134.2MB). Free memory was 125.8MB in the beginning and 254.2MB in the end (delta: -128.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-10-12 17:12:26,732 INFO L338 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.79ms. Allocated memory is still 186.6MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.05ms. Allocated memory is still 186.6MB. Free memory was 138.9MB in the beginning and 137.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.45ms. Allocated memory is still 186.6MB. Free memory was 137.3MB in the beginning and 136.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 216.94ms. Allocated memory is still 186.6MB. Free memory was 136.1MB in the beginning and 126.0MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2143.56ms. Allocated memory was 186.6MB in the beginning and 320.9MB in the end (delta: 134.2MB). Free memory was 125.8MB in the beginning and 254.2MB in the end (delta: -128.4MB). Peak memory consumption was 6.3MB. 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + N and consists of 3 locations. One deterministic module has affine ranking function N + -1 * j and consists of 3 locations. The remainder module has 116 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 53 StatesRemovedByMinimization, 2 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 10 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital78 mio100 ax100 hnf100 lsp175 ukn29 mio100 lsp87 div100 bol100 ite100 ukn100 eq167 hnf96 smp100 dnf191 smp70 tf100 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 83]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L32] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L34] FORK 0 fork 1 thread1(); VAL [N=1, m=0] [L35] FORK 0 fork 2, 2 thread2(); VAL [N=1, m=0] [L36] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, m=0] [L82] 3 k := 0; VAL [N=1, k=0, m=0] Loop: [L83] COND TRUE k < N [L84] B[k] := k; [L85] k := 0; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 83]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L32] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L34] FORK 0 fork 1 thread1(); VAL [N=1, m=0] [L35] FORK 0 fork 2, 2 thread2(); VAL [N=1, m=0] [L36] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, m=0] [L82] 3 k := 0; VAL [N=1, k=0, m=0] Loop: [L83] COND TRUE k < N [L84] B[k] := k; [L85] k := 0; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 39 PlacesBefore, 25 PlacesAfterwards, 34 TransitionsBefore, 18 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 18 TotalNumberOfCompositions, 360 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 330, independent: 327, independent conditional: 0, independent unconditional: 327, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 249, independent: 246, independent conditional: 0, independent unconditional: 246, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 249, independent: 242, independent conditional: 0, independent unconditional: 242, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 330, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 249, unknown conditional: 0, unknown unconditional: 249] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:12:26,751 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 [2023-10-12 17:12:26,949 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...