/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 RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:36:56,997 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:36:57,059 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:36:57,086 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:36:57,087 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:36:57,088 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:36:57,089 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:36:57,089 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:36:57,089 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:36:57,092 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:36:57,092 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:36:57,092 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:36:57,093 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:36:57,093 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:36:57,094 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:36:57,094 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:36:57,094 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:36:57,094 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:36:57,094 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:36:57,094 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:36:57,095 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:36:57,095 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:36:57,095 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:36:57,095 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:36:57,095 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:36:57,095 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:36:57,096 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:36:57,096 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:36:57,096 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:36:57,096 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:36:57,097 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:36:57,097 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:36:57,097 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:36:57,098 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:36:57,098 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 -> RABIN_PETRI_NET [2023-10-12 17:36:57,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:36:57,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:36:57,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:36:57,300 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:36:57,301 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:36:57,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update2.bpl [2023-10-12 17:36:57,302 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update2.bpl' [2023-10-12 17:36:57,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:36:57,330 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:36:57,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:57,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:36:57,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:36:57,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ... [2023-10-12 17:36:57,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ... [2023-10-12 17:36:57,354 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:36:57,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:57,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:36:57,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:36:57,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:36:57,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ... [2023-10-12 17:36:57,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ... [2023-10-12 17:36:57,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ... [2023-10-12 17:36:57,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ... [2023-10-12 17:36:57,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ... [2023-10-12 17:36:57,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ... [2023-10-12 17:36:57,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ... [2023-10-12 17:36:57,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ... [2023-10-12 17:36:57,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:36:57,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:36:57,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:36:57,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:36:57,376 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ... [2023-10-12 17:36:57,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:57,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:57,401 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:36:57,410 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:36:57,433 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:36:57,433 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:36:57,435 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:36:57,436 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:36:57,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:36:57,436 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:36:57,436 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:36:57,437 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:36:57,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:36:57,437 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:36:57,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:36:57,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:36:57,438 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:36:57,473 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:36:57,474 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:36:57,550 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:36:57,569 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:36:57,570 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:36:57,571 INFO L201 PluginConnector]: Adding new model map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:57 BoogieIcfgContainer [2023-10-12 17:36:57,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:36:57,591 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:36:57,591 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:36:57,594 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:36:57,595 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:57,595 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/2) ... [2023-10-12 17:36:57,596 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48114c86 and model type map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:36:57, skipping insertion in model container [2023-10-12 17:36:57,596 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:57,596 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:57" (2/2) ... [2023-10-12 17:36:57,597 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-aggr-update2.bpl [2023-10-12 17:36:57,638 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:36:57,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 94 flow [2023-10-12 17:36:57,672 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2023-10-12 17:36:57,672 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:36:57,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2023-10-12 17:36:57,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 94 flow [2023-10-12 17:36:57,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2023-10-12 17:36:57,680 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:36:57,688 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 76 flow [2023-10-12 17:36:57,690 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 76 flow [2023-10-12 17:36:57,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 76 flow [2023-10-12 17:36:57,696 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2023-10-12 17:36:57,696 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:36:57,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2023-10-12 17:36:57,697 INFO L119 LiptonReduction]: Number of co-enabled transitions 316 [2023-10-12 17:36:58,144 INFO L134 LiptonReduction]: Checked pairs total: 229 [2023-10-12 17:36:58,144 INFO L136 LiptonReduction]: Total number of compositions: 11 [2023-10-12 17:36:58,153 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:36:58,154 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:36:58,154 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:36:58,154 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:36:58,154 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:36:58,154 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:36:58,154 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:36:58,154 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:36:58,155 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:36:58,157 ERROR L47 etriNetUnfolderRabin]: [1:1A:[85] $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[][9], 2:2A:[109] 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][8], 3:3A:[88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i][0]][4:4A:[129] L51-1-->L51-1: Formula: (and (= (store v_A_30 v_thread1Thread1of1ForFork0_i_22 (let ((.cse0 (select v_A_30 v_thread1Thread1of1ForFork0_i_22))) (ite (< .cse0 0) 0 .cse0))) v_A_29) (= (+ v_thread1Thread1of1ForFork0_i_22 1) v_thread1Thread1of1ForFork0_i_21) (< v_thread1Thread1of1ForFork0_i_22 v_N_22)) InVars {A=v_A_30, N=v_N_22, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_22} OutVars{A=v_A_29, N=v_N_22, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_21} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork0_i][15]] [2023-10-12 17:36:58,159 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:58,159 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:36:58,161 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:58,161 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:58,165 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:36:58,165 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:36:58,168 ERROR L47 etriNetUnfolderRabin]: [1:1A:[85] $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[][9], 2:2A:[109] 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][8], 3:3A:[88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i][0]][4:4A:[129] L51-1-->L51-1: Formula: (and (= (store v_A_30 v_thread1Thread1of1ForFork0_i_22 (let ((.cse0 (select v_A_30 v_thread1Thread1of1ForFork0_i_22))) (ite (< .cse0 0) 0 .cse0))) v_A_29) (= (+ v_thread1Thread1of1ForFork0_i_22 1) v_thread1Thread1of1ForFork0_i_21) (< v_thread1Thread1of1ForFork0_i_22 v_N_22)) InVars {A=v_A_30, N=v_N_22, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_22} OutVars{A=v_A_29, N=v_N_22, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_21} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork0_i][15]] [2023-10-12 17:36:58,169 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:58,169 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:36:58,169 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:58,169 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:58,173 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [85] $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[] 45#[L34]true [109] 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] 47#[L34-1, $Ultimate##0]true [88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 49#[L51-1, L34-1]true [2023-10-12 17:36:58,173 INFO L750 eck$LassoCheckResult]: Loop: 49#[L51-1, L34-1]true [129] L51-1-->L51-1: Formula: (and (= (store v_A_30 v_thread1Thread1of1ForFork0_i_22 (let ((.cse0 (select v_A_30 v_thread1Thread1of1ForFork0_i_22))) (ite (< .cse0 0) 0 .cse0))) v_A_29) (= (+ v_thread1Thread1of1ForFork0_i_22 1) v_thread1Thread1of1ForFork0_i_21) (< v_thread1Thread1of1ForFork0_i_22 v_N_22)) InVars {A=v_A_30, N=v_N_22, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_22} OutVars{A=v_A_29, N=v_N_22, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_21} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork0_i] 49#[L51-1, L34-1]true [2023-10-12 17:36:58,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:58,179 INFO L85 PathProgramCache]: Analyzing trace with hash 114943, now seen corresponding path program 1 times [2023-10-12 17:36:58,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:58,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790603511] [2023-10-12 17:36:58,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:58,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:58,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:58,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:58,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:58,287 INFO L85 PathProgramCache]: Analyzing trace with hash 160, now seen corresponding path program 1 times [2023-10-12 17:36:58,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:58,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974667982] [2023-10-12 17:36:58,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:58,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:58,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:58,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:58,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:58,304 INFO L85 PathProgramCache]: Analyzing trace with hash 3563362, now seen corresponding path program 1 times [2023-10-12 17:36:58,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:58,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627979096] [2023-10-12 17:36:58,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:58,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:58,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:58,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:58,414 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:58,414 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:58,414 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:58,414 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:58,414 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:58,414 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:58,415 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:58,415 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:58,415 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update2.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:36:58,415 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:58,415 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:58,426 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:36:58,433 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:36:58,500 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:58,503 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:58,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:58,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:58,507 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:36:58,511 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:36:58,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:36:58,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:58,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:58,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:58,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:58,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:58,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:58,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:58,554 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:36:58,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:58,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:58,699 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:36:58,702 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:36:58,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:36:58,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:58,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:58,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:58,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:58,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:58,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:58,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:58,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:58,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:36:58,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:58,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:58,729 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:36:58,731 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:36:58,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:36:58,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:58,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:58,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:58,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:58,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:58,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:58,760 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:58,787 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:36:58,788 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:36:58,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:58,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:58,803 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:36:58,808 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:58,816 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:36:58,826 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:36:58,826 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:58,827 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2023-10-12 17:36:58,834 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 [2023-10-12 17:36:58,836 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:58,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:58,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:58,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:58,884 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:58,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:58,885 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:36:58,916 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:36:59,006 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:36:59,010 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:36:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-10-12 17:36:59,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:36:59,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:59,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:36:59,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:59,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:36:59,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:59,019 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 72 transitions, 360 flow [2023-10-12 17:36:59,021 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:36:59,022 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 72 transitions, 360 flow [2023-10-12 17:36:59,032 ERROR L47 etriNetUnfolderRabin]: [1:1A:[85] $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[][36], 2:2A:[109] 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][32], 5:3A:[112] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_14, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_8, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_pos, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][12], 16:4A:[126] $Ultimate##0-->L65-1: Formula: (and (= v_thread2Thread1of1ForFork1_j_25 0) (= (+ v_thread2Thread1of1ForFork1_pos_23 1) 0)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_25, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_pos][56]][18:5A:[128] L65-1-->L65-1: Formula: (and (let ((.cse0 (select v_A_23 v_thread2Thread1of1ForFork1_j_28))) (or (and (= v_thread2Thread1of1ForFork1_j_28 v_thread2_pos_24) (< 0 .cse0)) (and (= v_thread2_pos_24 v_thread2Thread1of1ForFork1_pos_26) (<= .cse0 0)))) (= v_thread2Thread1of1ForFork1_j_27 (+ v_thread2Thread1of1ForFork1_j_28 1)) (let ((.cse1 (select v_B_27 v_thread2Thread1of1ForFork1_j_28))) (or (and (= v_thread2_pos_24 v_thread2Thread1of1ForFork1_pos_25) (<= .cse1 0)) (and (= v_thread2Thread1of1ForFork1_j_28 v_thread2Thread1of1ForFork1_pos_25) (< 0 .cse1)))) (< v_thread2Thread1of1ForFork1_j_28 v_N_18)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_28, A=v_A_23, N=v_N_18, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_26, B=v_B_27} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_27, A=v_A_23, N=v_N_18, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_25, B=v_B_27} AuxVars[v_thread2_pos_24] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_pos][68]] [2023-10-12 17:36:59,032 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:59,032 INFO L124 PetriNetUnfolderBase]: 8/17 cut-off events. [2023-10-12 17:36:59,032 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:36:59,032 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:59,033 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [85] $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[] 45#[L34]true [109] 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] 47#[L34-1, $Ultimate##0]true [112] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_14, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_8, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_pos, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 89#[$Ultimate##0, $Ultimate##0, L35]true [126] $Ultimate##0-->L65-1: Formula: (and (= v_thread2Thread1of1ForFork1_j_25 0) (= (+ v_thread2Thread1of1ForFork1_pos_23 1) 0)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_25, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_pos] 91#[$Ultimate##0, L65-1, L35]true [2023-10-12 17:36:59,033 INFO L750 eck$LassoCheckResult]: Loop: 91#[$Ultimate##0, L65-1, L35]true [128] L65-1-->L65-1: Formula: (and (let ((.cse0 (select v_A_23 v_thread2Thread1of1ForFork1_j_28))) (or (and (= v_thread2Thread1of1ForFork1_j_28 v_thread2_pos_24) (< 0 .cse0)) (and (= v_thread2_pos_24 v_thread2Thread1of1ForFork1_pos_26) (<= .cse0 0)))) (= v_thread2Thread1of1ForFork1_j_27 (+ v_thread2Thread1of1ForFork1_j_28 1)) (let ((.cse1 (select v_B_27 v_thread2Thread1of1ForFork1_j_28))) (or (and (= v_thread2_pos_24 v_thread2Thread1of1ForFork1_pos_25) (<= .cse1 0)) (and (= v_thread2Thread1of1ForFork1_j_28 v_thread2Thread1of1ForFork1_pos_25) (< 0 .cse1)))) (< v_thread2Thread1of1ForFork1_j_28 v_N_18)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_28, A=v_A_23, N=v_N_18, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_26, B=v_B_27} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_27, A=v_A_23, N=v_N_18, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_25, B=v_B_27} AuxVars[v_thread2_pos_24] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_pos] 91#[$Ultimate##0, L65-1, L35]true [2023-10-12 17:36:59,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:59,035 INFO L85 PathProgramCache]: Analyzing trace with hash 3564103, now seen corresponding path program 1 times [2023-10-12 17:36:59,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:59,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515722807] [2023-10-12 17:36:59,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:59,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:59,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:59,060 INFO L85 PathProgramCache]: Analyzing trace with hash 159, now seen corresponding path program 1 times [2023-10-12 17:36:59,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:59,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935292328] [2023-10-12 17:36:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:59,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:59,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:59,079 INFO L85 PathProgramCache]: Analyzing trace with hash 110487321, now seen corresponding path program 1 times [2023-10-12 17:36:59,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:59,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983922566] [2023-10-12 17:36:59,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:59,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:59,252 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:59,252 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:59,252 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:59,252 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:59,252 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:59,252 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:59,252 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:59,252 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:59,252 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update2.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:36:59,252 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:59,253 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:59,255 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:36:59,258 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:36:59,306 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:36:59,309 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:36:59,310 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:36:59,414 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:36:59,445 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:59,445 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:59,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:59,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:59,449 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:36:59,451 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:36:59,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:36:59,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:59,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:59,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:59,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:59,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:59,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:59,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:59,492 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:36:59,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:59,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:59,494 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) [2023-10-12 17:36:59,496 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 [2023-10-12 17:36:59,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:36:59,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:59,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:59,504 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:36:59,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:59,535 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:36:59,535 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:36:59,583 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:59,636 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2023-10-12 17:36:59,636 INFO L444 ModelExtractionUtils]: 28 out of 50 variables were initially zero. Simplification set additionally 19 variables to zero. [2023-10-12 17:36:59,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:59,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:59,645 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) [2023-10-12 17:36:59,648 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 [2023-10-12 17:36:59,669 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:59,700 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2023-10-12 17:36:59,701 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:59,701 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, N) = -1*thread2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2023-10-12 17:36:59,705 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 [2023-10-12 17:36:59,706 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:59,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:59,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:59,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:59,733 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:59,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:59,734 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:36:59,734 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:36:59,818 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:36:59,819 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:36:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2023-10-12 17:36:59,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 132 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:36:59,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:59,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 132 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:36:59,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:59,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 132 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:36:59,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:59,823 INFO L430 stractBuchiCegarLoop]: Abstraction has has 33 places, 288 transitions, 2016 flow [2023-10-12 17:36:59,823 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:36:59,823 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 33 places, 288 transitions, 2016 flow [2023-10-12 17:36:59,836 ERROR L47 etriNetUnfolderRabin]: [1:1A:[85] $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[][145], 2:2A:[109] 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][129], 5:3A:[112] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_14, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_8, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_pos, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][49], 15:4A:[115] 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_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k][81], 36:5A:[101] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k][65]][37:6A:[127] L85-1-->L85-1: Formula: (and (= v_thread3Thread1of1ForFork2_k_25 (+ v_thread3Thread1of1ForFork2_k_26 1)) (< v_thread3Thread1of1ForFork2_k_26 v_N_16) (= v_B_23 (store v_B_24 v_thread3Thread1of1ForFork2_k_26 v_thread3Thread1of1ForFork2_k_26))) InVars {N=v_N_16, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_26, B=v_B_24} OutVars{N=v_N_16, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_25, B=v_B_23} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k, B][257]] [2023-10-12 17:36:59,836 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:59,836 INFO L124 PetriNetUnfolderBase]: 21/36 cut-off events. [2023-10-12 17:36:59,836 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:36:59,836 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:59,837 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [85] $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[] 45#[L34]true [109] 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] 47#[L34-1, $Ultimate##0]true [112] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_14, thread2Thread1of1ForFork1_pos=v_thread2Thread1of1ForFork1_pos_8, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_pos, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 89#[$Ultimate##0, $Ultimate##0, L35]true [115] 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_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k] 129#[$Ultimate##0, $Ultimate##0, L36, $Ultimate##0]true [101] $Ultimate##0-->L85-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] 131#[$Ultimate##0, L85-1, $Ultimate##0, L36]true [2023-10-12 17:36:59,837 INFO L750 eck$LassoCheckResult]: Loop: 131#[$Ultimate##0, L85-1, $Ultimate##0, L36]true [127] L85-1-->L85-1: Formula: (and (= v_thread3Thread1of1ForFork2_k_25 (+ v_thread3Thread1of1ForFork2_k_26 1)) (< v_thread3Thread1of1ForFork2_k_26 v_N_16) (= v_B_23 (store v_B_24 v_thread3Thread1of1ForFork2_k_26 v_thread3Thread1of1ForFork2_k_26))) InVars {N=v_N_16, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_26, B=v_B_24} OutVars{N=v_N_16, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_25, B=v_B_23} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k, B] 131#[$Ultimate##0, L85-1, $Ultimate##0, L36]true [2023-10-12 17:36:59,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:59,837 INFO L85 PathProgramCache]: Analyzing trace with hash 110486953, now seen corresponding path program 1 times [2023-10-12 17:36:59,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:59,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870794033] [2023-10-12 17:36:59,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:59,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:59,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:59,852 INFO L85 PathProgramCache]: Analyzing trace with hash 158, now seen corresponding path program 1 times [2023-10-12 17:36:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:59,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74324801] [2023-10-12 17:36:59,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:59,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:59,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:59,865 INFO L85 PathProgramCache]: Analyzing trace with hash -869871626, now seen corresponding path program 1 times [2023-10-12 17:36:59,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:59,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262454273] [2023-10-12 17:36:59,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:59,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:59,945 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:59,946 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:59,946 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:59,946 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:59,946 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:59,946 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:59,946 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:59,946 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:59,946 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update2.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:36:59,946 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:59,946 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:59,947 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:36:59,956 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:36:59,957 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:36:59,959 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:36:59,960 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:36:59,962 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:36:59,963 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:36:59,965 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:36:59,967 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:36:59,969 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:37:00,035 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:00,035 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:00,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:00,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:00,037 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) [2023-10-12 17:37:00,039 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 [2023-10-12 17:37:00,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 [2023-10-12 17:37:00,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:00,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:00,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:00,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:00,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:00,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:00,068 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:00,087 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:37:00,087 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:37:00,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:00,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:00,090 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) [2023-10-12 17:37:00,091 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 [2023-10-12 17:37:00,092 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:00,106 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:00,106 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:00,106 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_k, N) = -1*thread3Thread1of1ForFork2_k + 1*N Supporting invariants [] [2023-10-12 17:37:00,110 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 [2023-10-12 17:37:00,110 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:00,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:00,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:00,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:00,136 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:00,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:00,136 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:37:00,137 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:37:00,202 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:37:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-10-12 17:37:00,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:00,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:00,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:37:00,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:00,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:37:00,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:00,204 INFO L430 stractBuchiCegarLoop]: Abstraction has has 37 places, 1152 transitions, 10368 flow [2023-10-12 17:37:00,204 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:37:00,204 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 37 places, 1152 transitions, 10368 flow [2023-10-12 17:37:00,254 INFO L124 PetriNetUnfolderBase]: 193/282 cut-off events. [2023-10-12 17:37:00,254 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-10-12 17:37:00,255 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:37:00,260 INFO L201 PluginConnector]: Adding new model map-aggr-update2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:00 BoogieIcfgContainer [2023-10-12 17:37:00,260 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:00,261 INFO L158 Benchmark]: Toolchain (without parser) took 2930.33ms. Allocated memory was 215.0MB in the beginning and 346.0MB in the end (delta: 131.1MB). Free memory was 166.4MB in the beginning and 236.1MB in the end (delta: -69.7MB). Peak memory consumption was 61.9MB. Max. memory is 8.0GB. [2023-10-12 17:37:00,261 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 215.0MB. Free memory is still 167.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:00,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.71ms. Allocated memory is still 215.0MB. Free memory was 166.3MB in the beginning and 164.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:00,262 INFO L158 Benchmark]: Boogie Preprocessor took 19.30ms. Allocated memory is still 215.0MB. Free memory was 164.8MB in the beginning and 163.6MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:00,262 INFO L158 Benchmark]: RCFGBuilder took 195.57ms. Allocated memory is still 215.0MB. Free memory was 163.6MB in the beginning and 152.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:37:00,262 INFO L158 Benchmark]: BuchiAutomizer took 2669.07ms. Allocated memory was 215.0MB in the beginning and 346.0MB in the end (delta: 131.1MB). Free memory was 186.1MB in the beginning and 236.1MB in the end (delta: -50.0MB). Peak memory consumption was 81.4MB. Max. memory is 8.0GB. [2023-10-12 17:37:00,264 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.22ms. Allocated memory is still 215.0MB. Free memory is still 167.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.71ms. Allocated memory is still 215.0MB. Free memory was 166.3MB in the beginning and 164.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.30ms. Allocated memory is still 215.0MB. Free memory was 164.8MB in the beginning and 163.6MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 195.57ms. Allocated memory is still 215.0MB. Free memory was 163.6MB in the beginning and 152.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2669.07ms. Allocated memory was 215.0MB in the beginning and 346.0MB in the end (delta: 131.1MB). Free memory was 186.1MB in the beginning and 236.1MB in the end (delta: -50.0MB). Peak memory consumption was 81.4MB. 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 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). 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. One deterministic module has affine ranking function -1 * k + N and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. 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, 261 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 197 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 221 IncrementalHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 142 mSDtfsCounter, 221 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital53 mio100 ax100 hnf100 lsp137 ukn45 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf94 smp100 dnf143 smp85 tf100 neg100 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 207ms VariablesStem: 4 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s - 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, 36 PlacesBefore, 25 PlacesAfterwards, 29 TransitionsBefore, 18 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 229 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 209, independent: 207, independent conditional: 0, independent unconditional: 207, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 167, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 167, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 209, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 167, unknown conditional: 0, unknown unconditional: 167] , 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 correct! [2023-10-12 17:37:00,283 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 [2023-10-12 17:37:00,477 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 [2023-10-12 17:37:00,680 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...