/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-comp.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:36:57,391 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:36:57,468 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:36:57,497 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:36:57,498 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:36:57,499 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:36:57,500 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:36:57,500 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:36:57,500 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:36:57,504 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:36:57,504 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:36:57,504 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:36:57,505 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:36:57,506 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:36:57,506 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:36:57,507 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:36:57,507 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:36:57,507 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:36:57,507 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:36:57,507 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:36:57,507 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:36:57,508 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:36:57,508 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:36:57,508 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:36:57,508 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:36:57,509 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:36:57,509 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:36:57,509 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:36:57,509 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:36:57,509 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:36:57,510 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:36:57,511 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:36:57,511 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:36:57,512 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:36:57,512 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:36:57,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:36:57,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:36:57,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:36:57,761 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:36:57,762 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:36:57,763 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:36:57,763 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-comp.bpl' [2023-10-12 17:36:57,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:36:57,790 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:36:57,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:57,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:36:57,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:36:57,802 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:36:57" (1/1) ... [2023-10-12 17:36:57,808 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:36:57" (1/1) ... [2023-10-12 17:36:57,813 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:36:57,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:57,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:36:57,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:36:57,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:36:57,823 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:36:57" (1/1) ... [2023-10-12 17:36:57,823 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:36:57" (1/1) ... [2023-10-12 17:36:57,824 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:36:57" (1/1) ... [2023-10-12 17:36:57,824 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:36:57" (1/1) ... [2023-10-12 17:36:57,828 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:36:57" (1/1) ... [2023-10-12 17:36:57,832 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:36:57" (1/1) ... [2023-10-12 17:36:57,832 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:36:57" (1/1) ... [2023-10-12 17:36:57,833 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:36:57" (1/1) ... [2023-10-12 17:36:57,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:36:57,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:36:57,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:36:57,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:36:57,836 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:36:57" (1/1) ... [2023-10-12 17:36:57,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:57,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:57,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:57,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:36:57,902 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:36:57,902 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:36:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:36:57,903 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:36:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:36:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:36:57,903 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:36:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:36:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:36:57,903 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:36:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:36:57,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:36:57,904 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:36:57,949 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:36:57,951 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:36:58,044 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:36:58,050 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:36:58,050 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:36:58,052 INFO L201 PluginConnector]: Adding new model map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:58 BoogieIcfgContainer [2023-10-12 17:36:58,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:36:58,053 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:36:58,053 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:36:58,059 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:36:58,059 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:58,060 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:36:57" (1/2) ... [2023-10-12 17:36:58,062 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d6d9bfa and model type map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:36:58, skipping insertion in model container [2023-10-12 17:36:58,062 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:58,062 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:36:58" (2/2) ... [2023-10-12 17:36:58,067 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-comp.bpl [2023-10-12 17:36:58,141 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:36:58,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 94 flow [2023-10-12 17:36:58,210 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2023-10-12 17:36:58,211 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:36:58,215 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:36:58,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 94 flow [2023-10-12 17:36:58,219 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2023-10-12 17:36:58,224 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:36:58,243 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 76 flow [2023-10-12 17:36:58,246 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 76 flow [2023-10-12 17:36:58,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 76 flow [2023-10-12 17:36:58,255 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2023-10-12 17:36:58,255 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:36:58,256 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:36:58,256 INFO L119 LiptonReduction]: Number of co-enabled transitions 288 [2023-10-12 17:36:58,525 INFO L134 LiptonReduction]: Checked pairs total: 168 [2023-10-12 17:36:58,525 INFO L136 LiptonReduction]: Total number of compositions: 11 [2023-10-12 17:36:58,537 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:36:58,538 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:36:58,538 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:36:58,538 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:36:58,538 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:36:58,538 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:36:58,538 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:36:58,538 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:36:58,539 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:36:58,542 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][13], 2:2A:[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][7], 3:3A:[70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i][0]][4:4A:[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][17]] [2023-10-12 17:36:58,544 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:58,544 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:36:58,544 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:58,544 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:58,547 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:36:58,547 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:36:58,548 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][13], 2:2A:[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][7], 3:3A:[70] $Ultimate##0-->L34-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i][0]][4:4A:[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][17]] [2023-10-12 17:36:58,549 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:58,549 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:36:58,549 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:58,549 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:58,554 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:36:58,554 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:36:58,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:58,559 INFO L85 PathProgramCache]: Analyzing trace with hash 135478, now seen corresponding path program 1 times [2023-10-12 17:36:58,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:58,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768957129] [2023-10-12 17:36:58,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:58,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:58,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:58,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:58,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:58,647 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 1 times [2023-10-12 17:36:58,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:58,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956197405] [2023-10-12 17:36:58,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:58,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:58,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:58,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:58,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:58,660 INFO L85 PathProgramCache]: Analyzing trace with hash 4199928, now seen corresponding path program 1 times [2023-10-12 17:36:58,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:58,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428734307] [2023-10-12 17:36:58,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:58,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:58,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:58,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:58,745 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:58,745 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:58,746 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:58,746 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:58,746 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:58,746 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:58,746 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:58,746 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:58,746 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:36:58,746 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:58,747 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:58,762 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:58,800 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:58,850 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:58,854 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:58,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:58,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:58,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:58,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:36:58,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:58,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:58,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:58,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:58,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:58,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:58,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:58,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:36:58,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:58,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:58,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:58,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:58,902 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:58,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:36:58,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:36:58,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:58,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:58,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:58,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:58,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:58,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:58,940 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:58,964 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:36:58,964 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:36:58,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:58,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:58,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:58,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:36:58,970 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:58,977 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:36:58,978 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:58,978 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2023-10-12 17:36:58,981 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:36:58,984 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:59,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:59,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:59,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:59,032 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:59,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:59,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:59,059 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:36:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-10-12 17:36:59,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:36:59,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:59,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:36:59,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:59,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:36:59,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:59,173 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 72 transitions, 360 flow [2023-10-12 17:36:59,173 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:36:59,173 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 72 transitions, 360 flow [2023-10-12 17:36:59,179 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][52], 2:2A:[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][28], 5:3A:[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][20], 15:4A:[76] $Ultimate##0-->L46-1: Formula: (= v_thread2Thread1of1ForFork1_i_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_i=v_thread2Thread1of1ForFork1_i_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_i][32]][16:5A:[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][60]] [2023-10-12 17:36:59,180 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:59,180 INFO L124 PetriNetUnfolderBase]: 7/15 cut-off events. [2023-10-12 17:36:59,180 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:36:59,181 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:59,181 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] 89#[$Ultimate##0, $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] 91#[$Ultimate##0, L19, L46-1]true [2023-10-12 17:36:59,182 INFO L750 eck$LassoCheckResult]: Loop: 91#[$Ultimate##0, 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] 91#[$Ultimate##0, L19, L46-1]true [2023-10-12 17:36:59,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:59,183 INFO L85 PathProgramCache]: Analyzing trace with hash 4200607, now seen corresponding path program 1 times [2023-10-12 17:36:59,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:59,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728148402] [2023-10-12 17:36:59,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:59,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:59,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:59,204 INFO L85 PathProgramCache]: Analyzing trace with hash 140, now seen corresponding path program 1 times [2023-10-12 17:36:59,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:59,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650999182] [2023-10-12 17:36:59,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:59,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:59,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:59,242 INFO L85 PathProgramCache]: Analyzing trace with hash 130218926, now seen corresponding path program 1 times [2023-10-12 17:36:59,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:59,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026405622] [2023-10-12 17:36:59,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:59,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:59,329 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:59,329 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:59,329 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:59,329 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:59,329 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:59,329 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:59,329 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:59,329 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:59,329 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:36:59,330 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:59,330 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:59,333 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:59,337 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:59,351 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:59,353 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:59,356 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:59,411 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:59,411 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:59,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:59,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:59,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:59,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:36:59,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:59,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:59,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:59,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:59,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:36:59,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:59,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:59,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:59,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:59,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:59,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:59,466 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:59,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:36:59,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:36:59,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:59,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:59,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:59,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:59,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:59,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:59,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:59,532 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:59,547 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:36:59,547 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:36:59,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:59,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:59,548 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:59,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:36:59,552 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:59,586 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:36:59,586 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:59,586 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_i, N) = -1*thread2Thread1of1ForFork1_i + 1*N Supporting invariants [] [2023-10-12 17:36:59,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:59,594 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:59,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:59,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:59,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:59,626 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:59,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:59,627 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:36:59,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-10-12 17:36:59,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:36:59,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:59,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:36:59,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:59,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:36:59,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:59,710 INFO L430 stractBuchiCegarLoop]: Abstraction has has 33 places, 288 transitions, 2016 flow [2023-10-12 17:36:59,710 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:36:59,710 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 33 places, 288 transitions, 2016 flow [2023-10-12 17:36:59,725 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][209], 2:2A:[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][113], 5:3A:[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][81], 17:4A:[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][145], 36:5A:[82] $Ultimate##0-->L58-1: Formula: (= v_thread3Thread1of1ForFork2_i_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_i=v_thread3Thread1of1ForFork2_i_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_i][65]][37:6A:[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][257]] [2023-10-12 17:36:59,727 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:59,727 INFO L124 PetriNetUnfolderBase]: 21/36 cut-off events. [2023-10-12 17:36:59,727 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:36:59,727 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:59,728 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] 89#[$Ultimate##0, $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] 129#[$Ultimate##0, $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] 131#[L58-1, $Ultimate##0, $Ultimate##0, L20]true [2023-10-12 17:36:59,728 INFO L750 eck$LassoCheckResult]: Loop: 131#[L58-1, $Ultimate##0, $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] 131#[L58-1, $Ultimate##0, $Ultimate##0, L20]true [2023-10-12 17:36:59,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:59,728 INFO L85 PathProgramCache]: Analyzing trace with hash 130219519, now seen corresponding path program 1 times [2023-10-12 17:36:59,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:59,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057934697] [2023-10-12 17:36:59,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:59,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:59,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:59,749 INFO L85 PathProgramCache]: Analyzing trace with hash 139, now seen corresponding path program 1 times [2023-10-12 17:36:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:59,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799009814] [2023-10-12 17:36:59,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:59,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:59,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:59,770 INFO L85 PathProgramCache]: Analyzing trace with hash -258162099, now seen corresponding path program 1 times [2023-10-12 17:36:59,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:59,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471289002] [2023-10-12 17:36:59,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:59,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:59,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:59,859 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:59,859 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:59,859 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:59,859 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:59,859 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:59,859 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:59,859 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:59,859 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:59,859 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-comp.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:36:59,859 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:59,860 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:59,861 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:59,863 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:59,866 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:59,878 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:59,881 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:59,883 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:59,889 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:59,891 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:59,894 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:59,985 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:59,986 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:59,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:59,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:59,987 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:59,990 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:37:00,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:00,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:00,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:00,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:00,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:00,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:00,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:00,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:00,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:00,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:00,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:00,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:00,053 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:00,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:37:00,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:00,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:00,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:00,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:00,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:00,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:00,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:00,089 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:00,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:00,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:00,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:00,098 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:37:00,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:00,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:00,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:00,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:00,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:00,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:00,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:00,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:00,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:37:00,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:00,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:00,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:00,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:00,297 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:37:00,299 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:37:00,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:00,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:00,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:00,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:00,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:00,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:00,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:00,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:00,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:00,331 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:37:00,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:00,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:00,333 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:37:00,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:00,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:00,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:00,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:00,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:00,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:00,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:00,357 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:37:00,364 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:00,375 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:37:00,375 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:37:00,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:00,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:00,383 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:37:00,385 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:37:00,386 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:00,407 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:00,407 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:00,408 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_i, N) = -1*thread3Thread1of1ForFork2_i + 1*N Supporting invariants [] [2023-10-12 17:37:00,412 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:37:00,413 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:00,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:00,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:00,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:00,447 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:00,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:00,449 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:37:00,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-10-12 17:37:00,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:00,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:00,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:37:00,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:00,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:37:00,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:00,524 INFO L430 stractBuchiCegarLoop]: Abstraction has has 37 places, 1152 transitions, 10368 flow [2023-10-12 17:37:00,524 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:37:00,525 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 37 places, 1152 transitions, 10368 flow [2023-10-12 17:37:00,602 INFO L124 PetriNetUnfolderBase]: 193/282 cut-off events. [2023-10-12 17:37:00,602 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-10-12 17:37:00,602 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:37:00,607 INFO L201 PluginConnector]: Adding new model map-comp.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:00 BoogieIcfgContainer [2023-10-12 17:37:00,607 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:00,608 INFO L158 Benchmark]: Toolchain (without parser) took 2817.59ms. Allocated memory was 192.9MB in the beginning and 270.5MB in the end (delta: 77.6MB). Free memory was 147.1MB in the beginning and 175.9MB in the end (delta: -28.8MB). Peak memory consumption was 49.8MB. Max. memory is 8.0GB. [2023-10-12 17:37:00,608 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 192.9MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:00,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.11ms. Allocated memory is still 192.9MB. Free memory was 147.1MB in the beginning and 145.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:00,609 INFO L158 Benchmark]: Boogie Preprocessor took 19.37ms. Allocated memory is still 192.9MB. Free memory was 145.4MB in the beginning and 144.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:00,609 INFO L158 Benchmark]: RCFGBuilder took 217.47ms. Allocated memory is still 192.9MB. Free memory was 144.4MB in the beginning and 134.8MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:37:00,609 INFO L158 Benchmark]: BuchiAutomizer took 2553.82ms. Allocated memory was 192.9MB in the beginning and 270.5MB in the end (delta: 77.6MB). Free memory was 134.8MB in the beginning and 175.9MB in the end (delta: -41.1MB). Peak memory consumption was 37.2MB. Max. memory is 8.0GB. [2023-10-12 17:37:00,611 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.27ms. Allocated memory is still 192.9MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.11ms. Allocated memory is still 192.9MB. Free memory was 147.1MB in the beginning and 145.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.37ms. Allocated memory is still 192.9MB. Free memory was 145.4MB in the beginning and 144.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 217.47ms. Allocated memory is still 192.9MB. Free memory was 144.4MB in the beginning and 134.8MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2553.82ms. Allocated memory was 192.9MB in the beginning and 270.5MB in the end (delta: 77.6MB). Free memory was 134.8MB in the beginning and 175.9MB in the end (delta: -41.1MB). Peak memory consumption was 37.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 3 locations. One deterministic module has affine ranking function -1 * i + N and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 264 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 204 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 213 IncrementalHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 147 mSDtfsCounter, 213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital42 mio100 ax100 hnf100 lsp77 ukn59 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf93 smp100 dnf100 smp100 tf100 neg100 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 77ms 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: 20, independent: 20, independent conditional: 0, independent unconditional: 20, 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:37:00,627 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:37:00,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-10-12 17:37:01,028 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...