/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_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-comp.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:18:34,703 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:18:34,777 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:18:34,801 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:18:34,802 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:18:34,802 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:18:34,803 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:18:34,803 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:18:34,803 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:18:34,806 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:18:34,807 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:18:34,807 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:18:34,807 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:18:34,808 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:18:34,808 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:18:34,808 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:18:34,808 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:18:34,808 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:18:34,809 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:18:34,809 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:18:34,809 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:18:34,809 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:18:34,809 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:18:34,810 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:18:34,810 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:18:34,810 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:18:34,810 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:18:34,810 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:18:34,810 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:18:34,810 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:18:34,811 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:18:34,811 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:18:34,812 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:18:34,813 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:18:34,813 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_PETRI_NET [2023-10-12 17:18:35,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:18:35,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:18:35,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:18:35,034 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:18:35,034 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:18:35,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-comp.bpl [2023-10-12 17:18:35,035 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-comp.bpl' [2023-10-12 17:18:35,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:18:35,064 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:18:35,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:35,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:18:35,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:18:35,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:35" (1/1) ... [2023-10-12 17:18:35,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:35" (1/1) ... [2023-10-12 17:18:35,086 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:18:35,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:35,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:18:35,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:18:35,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:18:35,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:35" (1/1) ... [2023-10-12 17:18:35,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:35" (1/1) ... [2023-10-12 17:18:35,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:35" (1/1) ... [2023-10-12 17:18:35,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:35" (1/1) ... [2023-10-12 17:18:35,100 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:35" (1/1) ... [2023-10-12 17:18:35,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:35" (1/1) ... [2023-10-12 17:18:35,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:35" (1/1) ... [2023-10-12 17:18:35,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:35" (1/1) ... [2023-10-12 17:18:35,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:18:35,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:18:35,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:18:35,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:18:35,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:35" (1/1) ... [2023-10-12 17:18:35,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:35,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:35,134 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:18:35,148 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:18:35,161 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:18:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:18:35,161 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:18:35,161 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:18:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:18:35,162 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:18:35,162 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:18:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:18:35,162 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:18:35,162 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:18:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:18:35,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:18:35,163 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:18:35,201 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:18:35,202 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:18:35,304 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:18:35,309 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:18:35,309 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:18:35,310 INFO L201 PluginConnector]: Adding new model map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:35 BoogieIcfgContainer [2023-10-12 17:18:35,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:18:35,311 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:18:35,311 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:18:35,314 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:18:35,315 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:35,315 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-comp.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:35" (1/2) ... [2023-10-12 17:18:35,317 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1725913 and model type map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:18:35, skipping insertion in model container [2023-10-12 17:18:35,317 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:35,317 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:35" (2/2) ... [2023-10-12 17:18:35,318 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-comp.bpl [2023-10-12 17:18:35,385 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:18:35,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 94 flow [2023-10-12 17:18:35,421 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2023-10-12 17:18:35,422 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:18:35,425 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 56 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2023-10-12 17:18:35,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 94 flow [2023-10-12 17:18:35,428 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2023-10-12 17:18:35,430 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:18:35,440 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 76 flow [2023-10-12 17:18:35,444 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 76 flow [2023-10-12 17:18:35,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 76 flow [2023-10-12 17:18:35,453 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2023-10-12 17:18:35,453 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:18:35,454 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 56 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2023-10-12 17:18:35,454 INFO L119 LiptonReduction]: Number of co-enabled transitions 288 [2023-10-12 17:18:35,718 INFO L134 LiptonReduction]: Checked pairs total: 168 [2023-10-12 17:18:35,718 INFO L136 LiptonReduction]: Total number of compositions: 11 [2023-10-12 17:18:35,728 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:18:35,728 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:18:35,728 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:18:35,728 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:18:35,728 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:18:35,729 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:18:35,729 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:18:35,729 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:18:35,729 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:18:35,732 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:35,732 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:18:35,732 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:35,732 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:35,735 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:18:35,735 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:18:35,735 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:35,736 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:18:35,736 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:35,736 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:35,739 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [107] $Ultimate##0-->L18: Formula: (and (= v_A_18 v_B_12) (<= 0 v_k_6) (< v_k_6 v_N_20)) InVars {A=v_A_18, N=v_N_20, k=v_k_6} OutVars{A=v_A_18, N=v_N_20, k=v_k_6, B=v_B_12} AuxVars[] AssignedVars[B] 45#[L18]true [90] L18-->$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#[L18-1, $Ultimate##0]true [70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 49#[L34-1, L18-1]true [2023-10-12 17:18:35,739 INFO L750 eck$LassoCheckResult]: Loop: 49#[L34-1, L18-1]true [110] L34-1-->L34-1: Formula: (and (= v_thread1Thread1of1ForFork0_i_23 (+ v_thread1Thread1of1ForFork0_i_24 1)) (= v_A_36 (store v_A_37 v_thread1Thread1of1ForFork0_i_24 (+ (select v_A_37 v_thread1Thread1of1ForFork0_i_24) 1))) (< v_thread1Thread1of1ForFork0_i_24 v_N_30)) InVars {A=v_A_37, N=v_N_30, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_24} OutVars{A=v_A_36, N=v_N_30, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_23} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork0_i] 49#[L34-1, L18-1]true [2023-10-12 17:18:35,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:35,743 INFO L85 PathProgramCache]: Analyzing trace with hash 135478, now seen corresponding path program 1 times [2023-10-12 17:18:35,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:35,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050973825] [2023-10-12 17:18:35,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:35,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:35,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:35,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:35,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:35,859 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 1 times [2023-10-12 17:18:35,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:35,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368897962] [2023-10-12 17:18:35,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:35,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:35,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:35,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:35,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:35,873 INFO L85 PathProgramCache]: Analyzing trace with hash 4199928, now seen corresponding path program 1 times [2023-10-12 17:18:35,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:35,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174520611] [2023-10-12 17:18:35,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:35,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:35,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:35,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:35,953 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:35,954 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:35,954 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:35,954 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:35,954 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:35,954 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:35,954 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:35,955 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:35,955 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:18:35,955 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:35,955 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:35,966 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:18:35,990 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:18:36,029 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:36,032 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:36,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:36,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:36,036 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:18:36,041 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:18:36,053 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:18:36,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:36,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:36,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:36,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:36,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:36,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:36,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:36,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:36,072 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:18:36,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:36,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:36,073 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:18:36,075 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:18:36,077 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:18:36,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:36,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:36,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:36,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:36,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:36,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:36,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:36,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:36,099 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:18:36,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:36,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:36,101 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:18:36,103 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:18:36,105 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:18:36,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:36,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:36,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:36,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:36,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:36,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:36,137 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:36,149 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:18:36,149 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:18:36,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:36,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:36,152 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:18:36,152 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:18:36,189 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:36,197 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:18:36,198 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:36,198 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2023-10-12 17:18:36,209 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:18:36,212 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:18:36,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:36,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:36,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:36,300 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:18:36,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:36,301 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:18:36,351 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:18:36,353 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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:18:36,482 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. 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 5 states and 270 transitions. [2023-10-12 17:18:36,483 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:36,493 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:36,496 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:18:36,502 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:18:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-10-12 17:18:36,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:18:36,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:36,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:18:36,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:36,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:18:36,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:36,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:36,606 INFO L124 PetriNetUnfolderBase]: 369/535 cut-off events. [2023-10-12 17:18:36,606 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-10-12 17:18:36,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 535 events. 369/535 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1699 event pairs, 2 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 1005. Up to 168 conditions per place. [2023-10-12 17:18:36,610 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:36,615 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:36,615 INFO L430 stractBuchiCegarLoop]: Abstraction has has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:36,615 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:18:36,616 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:36,626 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:36,626 INFO L124 PetriNetUnfolderBase]: 41/62 cut-off events. [2023-10-12 17:18:36,626 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:18:36,627 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:36,627 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [107] $Ultimate##0-->L18: Formula: (and (= v_A_18 v_B_12) (<= 0 v_k_6) (< v_k_6 v_N_20)) InVars {A=v_A_18, N=v_N_20, k=v_k_6} OutVars{A=v_A_18, N=v_N_20, k=v_k_6, B=v_B_12} AuxVars[] AssignedVars[B] 45#[L18]true [90] L18-->$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#[L18-1, $Ultimate##0]true [93] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 98#[$Ultimate##0, $Ultimate##0, L19]true [70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 100#[L34-1, $Ultimate##0, L19]true [76] $Ultimate##0-->L46-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i] 102#[L34-1, L19, L46-1]true [109] L46-1-->L46-1: Formula: (and (< v_thread2Thread1of1ForFork1_i_22 v_N_26) (= v_A_26 (store v_A_27 v_thread2Thread1of1ForFork1_i_22 (+ 2 (select v_A_27 v_thread2Thread1of1ForFork1_i_22)))) (= v_thread2Thread1of1ForFork1_i_21 (+ v_thread2Thread1of1ForFork1_i_22 1))) InVars {A=v_A_27, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_22, N=v_N_26} OutVars{A=v_A_26, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_21, N=v_N_26} AuxVars[] AssignedVars[A, thread2Thread1of1ForFork1_i] 102#[L34-1, L19, L46-1]true [2023-10-12 17:18:36,627 INFO L750 eck$LassoCheckResult]: Loop: 102#[L34-1, L19, L46-1]true [109] L46-1-->L46-1: Formula: (and (< v_thread2Thread1of1ForFork1_i_22 v_N_26) (= v_A_26 (store v_A_27 v_thread2Thread1of1ForFork1_i_22 (+ 2 (select v_A_27 v_thread2Thread1of1ForFork1_i_22)))) (= v_thread2Thread1of1ForFork1_i_21 (+ v_thread2Thread1of1ForFork1_i_22 1))) InVars {A=v_A_27, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_22, N=v_N_26} OutVars{A=v_A_26, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_21, N=v_N_26} AuxVars[] AssignedVars[A, thread2Thread1of1ForFork1_i] 102#[L34-1, L19, L46-1]true [109] L46-1-->L46-1: Formula: (and (< v_thread2Thread1of1ForFork1_i_22 v_N_26) (= v_A_26 (store v_A_27 v_thread2Thread1of1ForFork1_i_22 (+ 2 (select v_A_27 v_thread2Thread1of1ForFork1_i_22)))) (= v_thread2Thread1of1ForFork1_i_21 (+ v_thread2Thread1of1ForFork1_i_22 1))) InVars {A=v_A_27, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_22, N=v_N_26} OutVars{A=v_A_26, thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_21, N=v_N_26} AuxVars[] AssignedVars[A, thread2Thread1of1ForFork1_i] 102#[L34-1, L19, L46-1]true [2023-10-12 17:18:36,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:36,628 INFO L85 PathProgramCache]: Analyzing trace with hash -258187270, now seen corresponding path program 1 times [2023-10-12 17:18:36,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:36,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536059988] [2023-10-12 17:18:36,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:36,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:36,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:36,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:36,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:36,663 INFO L85 PathProgramCache]: Analyzing trace with hash 4449, now seen corresponding path program 1 times [2023-10-12 17:18:36,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:36,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368493185] [2023-10-12 17:18:36,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:36,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:36,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:36,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:36,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:36,693 INFO L85 PathProgramCache]: Analyzing trace with hash 990140186, now seen corresponding path program 2 times [2023-10-12 17:18:36,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:36,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038272981] [2023-10-12 17:18:36,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:36,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:36,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:36,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:36,833 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:36,833 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:36,833 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:36,833 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:36,833 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:36,833 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:36,833 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:36,833 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:36,833 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:18:36,834 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:36,834 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:36,835 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:18:36,838 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:18:36,916 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:18:36,919 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:18:36,922 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:18:37,012 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:37,013 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:37,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:37,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:37,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:18:37,017 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:18:37,026 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:18:37,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:37,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:37,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:37,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:37,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:37,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:37,036 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:18:37,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:37,046 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:18:37,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:37,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:37,048 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:18:37,050 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:18:37,051 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:18:37,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:37,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:37,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:37,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:37,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:37,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:37,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:37,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:37,081 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:18:37,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:37,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:37,092 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:18:37,094 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:18:37,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:18:37,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:37,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:37,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:37,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:37,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:37,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:37,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:37,123 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:18:37,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:37,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:37,124 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:18:37,126 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:18:37,127 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:18:37,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:37,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:37,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:37,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:37,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:37,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:37,156 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:37,177 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-10-12 17:18:37,177 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:18:37,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:37,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:37,178 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:18:37,180 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:18:37,182 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:37,203 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:18:37,203 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:37,203 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_i, N) = -1*thread2Thread1of1ForFork1_i + 1*N Supporting invariants [] [2023-10-12 17:18:37,217 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:18:37,220 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:18:37,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:37,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:37,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:37,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:18:37,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:18:37,278 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:18:37,278 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:37,415 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 357 transitions. [2023-10-12 17:18:37,415 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:37,439 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:37,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:18:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:37,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2023-10-12 17:18:37,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:18:37,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:37,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:18:37,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:37,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 6 letters. Loop has 4 letters. [2023-10-12 17:18:37,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:37,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 3048 transitions, 21336 flow [2023-10-12 17:18:37,745 INFO L124 PetriNetUnfolderBase]: 1372/1935 cut-off events. [2023-10-12 17:18:37,746 INFO L125 PetriNetUnfolderBase]: For 316/316 co-relation queries the response was YES. [2023-10-12 17:18:37,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6206 conditions, 1935 events. 1372/1935 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 7790 event pairs, 2 based on Foata normal form. 0/1102 useless extension candidates. Maximal degree in co-relation 5678. Up to 659 conditions per place. [2023-10-12 17:18:37,748 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 49 places, 3048 transitions, 21336 flow [2023-10-12 17:18:37,749 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:18:37,784 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 49 places, 3048 transitions, 21336 flow [2023-10-12 17:18:37,784 INFO L430 stractBuchiCegarLoop]: Abstraction has has 49 places, 3048 transitions, 21336 flow [2023-10-12 17:18:37,784 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:18:37,785 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 49 places, 3048 transitions, 21336 flow [2023-10-12 17:18:37,805 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:37,805 INFO L124 PetriNetUnfolderBase]: 68/109 cut-off events. [2023-10-12 17:18:37,806 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-10-12 17:18:37,806 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:37,807 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [107] $Ultimate##0-->L18: Formula: (and (= v_A_18 v_B_12) (<= 0 v_k_6) (< v_k_6 v_N_20)) InVars {A=v_A_18, N=v_N_20, k=v_k_6} OutVars{A=v_A_18, N=v_N_20, k=v_k_6, B=v_B_12} AuxVars[] AssignedVars[B] 45#[L18]true [90] L18-->$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#[L18-1, $Ultimate##0]true [93] L18-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 98#[$Ultimate##0, $Ultimate##0, L19]true [70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 100#[L34-1, $Ultimate##0, L19]true [96] L19-->$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_i=v_thread3Thread1of1ForFork2_i_14, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_i, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 171#[L34-1, $Ultimate##0, L20, $Ultimate##0]true [82] $Ultimate##0-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i] 173#[L34-1, L58-1, $Ultimate##0, L20]true [108] L58-1-->L58-1: Formula: (and (= v_thread3Thread1of1ForFork2_i_19 (+ v_thread3Thread1of1ForFork2_i_20 1)) (= (store v_B_15 v_thread3Thread1of1ForFork2_i_20 (+ (select v_B_15 v_thread3Thread1of1ForFork2_i_20) 3)) v_B_14) (< v_thread3Thread1of1ForFork2_i_20 v_N_22)) InVars {N=v_N_22, thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_20, B=v_B_15} OutVars{N=v_N_22, thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_19, B=v_B_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i, B] 173#[L34-1, L58-1, $Ultimate##0, L20]true [2023-10-12 17:18:37,807 INFO L750 eck$LassoCheckResult]: Loop: 173#[L34-1, L58-1, $Ultimate##0, L20]true [108] L58-1-->L58-1: Formula: (and (= v_thread3Thread1of1ForFork2_i_19 (+ v_thread3Thread1of1ForFork2_i_20 1)) (= (store v_B_15 v_thread3Thread1of1ForFork2_i_20 (+ (select v_B_15 v_thread3Thread1of1ForFork2_i_20) 3)) v_B_14) (< v_thread3Thread1of1ForFork2_i_20 v_N_22)) InVars {N=v_N_22, thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_20, B=v_B_15} OutVars{N=v_N_22, thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_19, B=v_B_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i, B] 173#[L34-1, L58-1, $Ultimate##0, L20]true [108] L58-1-->L58-1: Formula: (and (= v_thread3Thread1of1ForFork2_i_19 (+ v_thread3Thread1of1ForFork2_i_20 1)) (= (store v_B_15 v_thread3Thread1of1ForFork2_i_20 (+ (select v_B_15 v_thread3Thread1of1ForFork2_i_20) 3)) v_B_14) (< v_thread3Thread1of1ForFork2_i_20 v_N_22)) InVars {N=v_N_22, thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_20, B=v_B_15} OutVars{N=v_N_22, thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_19, B=v_B_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i, B] 173#[L34-1, L58-1, $Ultimate##0, L20]true [2023-10-12 17:18:37,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:37,808 INFO L85 PathProgramCache]: Analyzing trace with hash 586147713, now seen corresponding path program 1 times [2023-10-12 17:18:37,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:37,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345685722] [2023-10-12 17:18:37,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:37,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:37,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:37,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:37,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:37,833 INFO L85 PathProgramCache]: Analyzing trace with hash 4417, now seen corresponding path program 1 times [2023-10-12 17:18:37,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:37,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933447901] [2023-10-12 17:18:37,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:37,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:37,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:37,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:37,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:37,851 INFO L85 PathProgramCache]: Analyzing trace with hash 647239873, now seen corresponding path program 2 times [2023-10-12 17:18:37,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:37,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141117492] [2023-10-12 17:18:37,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:37,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:37,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:37,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:38,012 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:38,012 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:38,012 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:38,012 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:38,012 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:38,012 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:38,012 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:38,012 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:38,012 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:18:38,013 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:38,013 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:38,015 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:18:38,062 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:18:38,064 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:18:38,066 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:18:38,068 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:18:38,070 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:18:38,072 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:18:38,074 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:18:38,077 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:18:38,171 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:38,171 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:38,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:38,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:38,173 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:38,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:18:38,193 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:18:38,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:38,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:38,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:38,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:38,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:38,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:38,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:38,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:38,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:38,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:38,228 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:38,235 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:18:38,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:38,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:38,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:38,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:38,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:38,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:38,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:38,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:18:38,257 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:38,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:38,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:38,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:38,261 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:38,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:18:38,283 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:18:38,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:38,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:38,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:38,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:38,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:38,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:38,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:38,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:38,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:38,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:38,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:38,299 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:38,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:18:38,302 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:18:38,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:38,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:38,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:38,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:38,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:38,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:38,329 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:38,338 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:18:38,338 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:18:38,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:38,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:38,340 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:38,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:18:38,344 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:38,365 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:18:38,365 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:38,365 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_i, N) = -1*thread3Thread1of1ForFork2_i + 1*N Supporting invariants [] [2023-10-12 17:18:38,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:38,386 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:18:38,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:38,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:38,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:38,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:18:38,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:18:38,424 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:18:38,424 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:38,538 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 357 transitions. [2023-10-12 17:18:38,539 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:38,799 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:38,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:18:38,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2023-10-12 17:18:38,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:18:38,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:38,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:18:38,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:38,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:18:38,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:38,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 45312 transitions, 407808 flow [2023-10-12 17:18:39,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-10-12 17:18:46,775 INFO L124 PetriNetUnfolderBase]: 4401/6167 cut-off events. [2023-10-12 17:18:46,775 INFO L125 PetriNetUnfolderBase]: For 1121/1121 co-relation queries the response was YES. [2023-10-12 17:18:46,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25597 conditions, 6167 events. 4401/6167 cut-off events. For 1121/1121 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 30125 event pairs, 11 based on Foata normal form. 0/3261 useless extension candidates. Maximal degree in co-relation 23417. Up to 2193 conditions per place. [2023-10-12 17:18:46,780 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 63 places, 45312 transitions, 407808 flow [2023-10-12 17:18:47,180 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 63 places, 45312 transitions, 407808 flow [2023-10-12 17:18:47,180 INFO L430 stractBuchiCegarLoop]: Abstraction has has 63 places, 45312 transitions, 407808 flow [2023-10-12 17:18:47,180 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:18:47,180 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 63 places, 45312 transitions, 407808 flow [2023-10-12 17:18:56,290 INFO L124 PetriNetUnfolderBase]: 4401/6167 cut-off events. [2023-10-12 17:18:56,290 INFO L125 PetriNetUnfolderBase]: For 1121/1121 co-relation queries the response was YES. [2023-10-12 17:18:56,290 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2023-10-12 17:18:56,295 INFO L201 PluginConnector]: Adding new model map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:18:56 BoogieIcfgContainer [2023-10-12 17:18:56,295 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:18:56,296 INFO L158 Benchmark]: Toolchain (without parser) took 21231.44ms. Allocated memory was 228.6MB in the beginning and 997.2MB in the end (delta: 768.6MB). Free memory was 177.8MB in the beginning and 668.3MB in the end (delta: -490.4MB). Peak memory consumption was 730.5MB. Max. memory is 8.0GB. [2023-10-12 17:18:56,296 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 228.6MB. Free memory is still 178.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:18:56,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.47ms. Allocated memory is still 228.6MB. Free memory was 177.7MB in the beginning and 176.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:18:56,296 INFO L158 Benchmark]: Boogie Preprocessor took 17.25ms. Allocated memory is still 228.6MB. Free memory was 176.3MB in the beginning and 175.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:18:56,296 INFO L158 Benchmark]: RCFGBuilder took 202.94ms. Allocated memory is still 228.6MB. Free memory was 175.1MB in the beginning and 165.5MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:18:56,297 INFO L158 Benchmark]: BuchiAutomizer took 20984.10ms. Allocated memory was 228.6MB in the beginning and 997.2MB in the end (delta: 768.6MB). Free memory was 165.5MB in the beginning and 668.3MB in the end (delta: -502.8MB). Peak memory consumption was 717.9MB. Max. memory is 8.0GB. [2023-10-12 17:18:56,298 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 228.6MB. Free memory is still 178.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.47ms. Allocated memory is still 228.6MB. Free memory was 177.7MB in the beginning and 176.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.25ms. Allocated memory is still 228.6MB. Free memory was 176.3MB in the beginning and 175.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 202.94ms. Allocated memory is still 228.6MB. Free memory was 175.1MB in the beginning and 165.5MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 20984.10ms. Allocated memory was 228.6MB in the beginning and 997.2MB in the end (delta: 768.6MB). Free memory was 165.5MB in the beginning and 668.3MB in the end (delta: -502.8MB). Peak memory consumption was 717.9MB. 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 -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.8s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. 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: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 344 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 320 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 371 IncrementalHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 187 mSDtfsCounter, 371 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital63 mio100 ax100 hnf100 lsp82 ukn56 mio100 lsp75 div100 bol100 ite100 ukn100 eq154 hnf91 smp100 dnf100 smp100 tf102 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 98ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s - 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.3s, 36 PlacesBefore, 25 PlacesAfterwards, 29 TransitionsBefore, 18 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 168 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 168, independent: 168, independent conditional: 0, independent unconditional: 168, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 144, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 144, independent: 142, independent conditional: 0, independent unconditional: 142, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 168, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 144, unknown conditional: 0, unknown unconditional: 144] , 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:18:56,313 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...