/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update3.bpl


--------------------------------------------------------------------------------


This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m
[2023-10-12 17:36:56,709 INFO  L172        SettingsManager]: Resetting all preferences to default values...
[2023-10-12 17:36:56,771 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:56,799 INFO  L114        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-12 17:36:56,800 INFO  L135        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-12 17:36:56,800 INFO  L137        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-12 17:36:56,801 INFO  L135        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-12 17:36:56,801 INFO  L137        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-12 17:36:56,801 INFO  L137        SettingsManager]:  * Use SBE=true
[2023-10-12 17:36:56,801 INFO  L135        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2023-10-12 17:36:56,802 INFO  L137        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2023-10-12 17:36:56,802 INFO  L137        SettingsManager]:  * Use old map elimination=false
[2023-10-12 17:36:56,802 INFO  L137        SettingsManager]:  * Use external solver (rank synthesis)=false
[2023-10-12 17:36:56,802 INFO  L137        SettingsManager]:  * Use only trivial implications for array writes=true
[2023-10-12 17:36:56,802 INFO  L137        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2023-10-12 17:36:56,803 INFO  L135        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-12 17:36:56,803 INFO  L137        SettingsManager]:  * sizeof long=4
[2023-10-12 17:36:56,803 INFO  L137        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-12 17:36:56,803 INFO  L137        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-12 17:36:56,804 INFO  L137        SettingsManager]:  * sizeof POINTER=4
[2023-10-12 17:36:56,812 INFO  L137        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-12 17:36:56,814 INFO  L137        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2023-10-12 17:36:56,814 INFO  L137        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2023-10-12 17:36:56,814 INFO  L137        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2023-10-12 17:36:56,814 INFO  L137        SettingsManager]:  * sizeof long double=12
[2023-10-12 17:36:56,814 INFO  L137        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-12 17:36:56,815 INFO  L137        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2023-10-12 17:36:56,815 INFO  L137        SettingsManager]:  * Use constant arrays=true
[2023-10-12 17:36:56,815 INFO  L137        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2023-10-12 17:36:56,815 INFO  L135        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-12 17:36:56,816 INFO  L137        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-12 17:36:56,816 INFO  L135        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-12 17:36:56,816 INFO  L137        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-12 17:36:56,818 INFO  L135        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2023-10-12 17:36:56,818 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,026 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-12 17:36:57,055 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-12 17:36:57,057 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-12 17:36:57,058 INFO  L270        PluginConnector]: Initializing Boogie PL CUP Parser...
[2023-10-12 17:36:57,060 INFO  L274        PluginConnector]: Boogie PL CUP Parser initialized
[2023-10-12 17:36:57,061 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update3.bpl
[2023-10-12 17:36:57,061 INFO  L110           BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update3.bpl'
[2023-10-12 17:36:57,095 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-12 17:36:57,097 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2023-10-12 17:36:57,097 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-12 17:36:57,097 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-12 17:36:57,098 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-12 17:36:57,107 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ...
[2023-10-12 17:36:57,114 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ...
[2023-10-12 17:36:57,119 INFO  L138                Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0
[2023-10-12 17:36:57,120 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-12 17:36:57,121 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-12 17:36:57,121 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-12 17:36:57,121 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-10-12 17:36:57,126 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ...
[2023-10-12 17:36:57,127 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ...
[2023-10-12 17:36:57,128 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ...
[2023-10-12 17:36:57,128 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ...
[2023-10-12 17:36:57,130 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ...
[2023-10-12 17:36:57,132 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ...
[2023-10-12 17:36:57,133 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ...
[2023-10-12 17:36:57,134 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ...
[2023-10-12 17:36:57,134 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-12 17:36:57,135 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-12 17:36:57,135 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-10-12 17:36:57,135 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-10-12 17:36:57,136 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/1) ...
[2023-10-12 17:36:57,141 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:36:57,152 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-10-12 17:36:57,189 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,198 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,218 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration
[2023-10-12 17:36:57,218 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2023-10-12 17:36:57,218 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2023-10-12 17:36:57,219 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration
[2023-10-12 17:36:57,219 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2023-10-12 17:36:57,219 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2023-10-12 17:36:57,219 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration
[2023-10-12 17:36:57,219 INFO  L130     BoogieDeclarations]: Found specification of procedure thread3
[2023-10-12 17:36:57,219 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread3
[2023-10-12 17:36:57,219 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration
[2023-10-12 17:36:57,220 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-12 17:36:57,220 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-12 17:36:57,221 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,266 INFO  L236             CfgBuilder]: Building ICFG
[2023-10-12 17:36:57,267 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-12 17:36:57,389 INFO  L277             CfgBuilder]: Performing block encoding
[2023-10-12 17:36:57,394 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-12 17:36:57,394 INFO  L302             CfgBuilder]: Removed 0 assume(true) statements.
[2023-10-12 17:36:57,395 INFO  L201        PluginConnector]: Adding new model map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:57 BoogieIcfgContainer
[2023-10-12 17:36:57,395 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-12 17:36:57,396 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2023-10-12 17:36:57,396 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2023-10-12 17:36:57,401 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2023-10-12 17:36:57,402 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2023-10-12 17:36:57,402 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:57" (1/2) ...
[2023-10-12 17:36:57,404 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d3c28ef and model type map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:36:57, skipping insertion in model container
[2023-10-12 17:36:57,404 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2023-10-12 17:36:57,404 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:57" (2/2) ...
[2023-10-12 17:36:57,405 INFO  L332   chiAutomizerObserver]: Analyzing ICFG map-aggr-update3.bpl
[2023-10-12 17:36:57,463 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-10-12 17:36:57,482 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 104 flow
[2023-10-12 17:36:57,500 INFO  L124   PetriNetUnfolderBase]: 5/34 cut-off events.
[2023-10-12 17:36:57,500 INFO  L125   PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2023-10-12 17:36:57,504 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 5/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. 
[2023-10-12 17:36:57,504 INFO  L82        GeneralOperation]: Start removeDead. Operand has 42 places, 40 transitions, 104 flow
[2023-10-12 17:36:57,508 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 86 flow
[2023-10-12 17:36:57,510 INFO  L115   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2023-10-12 17:36:57,520 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 86 flow
[2023-10-12 17:36:57,522 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 86 flow
[2023-10-12 17:36:57,522 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 86 flow
[2023-10-12 17:36:57,529 INFO  L124   PetriNetUnfolderBase]: 5/34 cut-off events.
[2023-10-12 17:36:57,529 INFO  L125   PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2023-10-12 17:36:57,530 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 5/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. 
[2023-10-12 17:36:57,530 INFO  L119        LiptonReduction]: Number of co-enabled transitions 456
[2023-10-12 17:36:57,942 INFO  L134        LiptonReduction]: Checked pairs total: 360
[2023-10-12 17:36:57,942 INFO  L136        LiptonReduction]: Total number of compositions: 18
[2023-10-12 17:36:57,953 INFO  L305   stractBuchiCegarLoop]: Interprodecural is true
[2023-10-12 17:36:57,953 INFO  L306   stractBuchiCegarLoop]: Hoare is false
[2023-10-12 17:36:57,953 INFO  L307   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2023-10-12 17:36:57,954 INFO  L308   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2023-10-12 17:36:57,954 INFO  L309   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2023-10-12 17:36:57,954 INFO  L310   stractBuchiCegarLoop]: Difference is false
[2023-10-12 17:36:57,954 INFO  L311   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2023-10-12 17:36:57,954 INFO  L315   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ========
[2023-10-12 17:36:57,955 INFO  L67            RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 54 flow
[2023-10-12 17:36:57,959 ERROR L47    etriNetUnfolderRabin]: [1:1A:[83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3))  InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7}  OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7}  AuxVars[]  AssignedVars[][9], 2:2A:[114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14}  AuxVars[]  AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i][8], 3:3A:[88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0)  InVars {}  OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1}  AuxVars[]  AssignedVars[thread1Thread1of1ForFork0_i][0]][4:4A:[137] L51-1-->L51-1: Formula: (and (= v_thread1Thread1of1ForFork0_i_25 (+ v_thread1Thread1of1ForFork0_i_26 1)) (= (store v_A_32 v_thread1Thread1of1ForFork0_i_26 (let ((.cse0 (select v_A_32 v_thread1Thread1of1ForFork0_i_26))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_31) (< v_thread1Thread1of1ForFork0_i_26 v_N_28))  InVars {A=v_A_32, N=v_N_28, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_26}  OutVars{A=v_A_31, N=v_N_28, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_25}  AuxVars[]  AssignedVars[A, thread1Thread1of1ForFork0_i][16]]
[2023-10-12 17:36:57,961 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-10-12 17:36:57,962 INFO  L124   PetriNetUnfolderBase]: 0/3 cut-off events.
[2023-10-12 17:36:57,962 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-10-12 17:36:57,962 INFO  L72            RabinIsEmpty]: Finished rabinIsEmpty language is not empty
[2023-10-12 17:36:57,965 INFO  L337   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2023-10-12 17:36:57,966 INFO  L67            RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 54 flow
[2023-10-12 17:36:57,967 ERROR L47    etriNetUnfolderRabin]: [1:1A:[83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3))  InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7}  OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7}  AuxVars[]  AssignedVars[][9], 2:2A:[114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14}  AuxVars[]  AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i][8], 3:3A:[88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0)  InVars {}  OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1}  AuxVars[]  AssignedVars[thread1Thread1of1ForFork0_i][0]][4:4A:[137] L51-1-->L51-1: Formula: (and (= v_thread1Thread1of1ForFork0_i_25 (+ v_thread1Thread1of1ForFork0_i_26 1)) (= (store v_A_32 v_thread1Thread1of1ForFork0_i_26 (let ((.cse0 (select v_A_32 v_thread1Thread1of1ForFork0_i_26))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_31) (< v_thread1Thread1of1ForFork0_i_26 v_N_28))  InVars {A=v_A_32, N=v_N_28, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_26}  OutVars{A=v_A_31, N=v_N_28, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_25}  AuxVars[]  AssignedVars[A, thread1Thread1of1ForFork0_i][16]]
[2023-10-12 17:36:57,967 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-10-12 17:36:57,967 INFO  L124   PetriNetUnfolderBase]: 0/3 cut-off events.
[2023-10-12 17:36:57,967 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-10-12 17:36:57,968 INFO  L72            RabinIsEmpty]: Finished rabinIsEmpty language is not empty
[2023-10-12 17:36:57,972 INFO  L748   eck$LassoCheckResult]: Stem: 46#[$Ultimate##0]true [83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3))  InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7}  OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7}  AuxVars[]  AssignedVars[] 48#[L34]true [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14}  AuxVars[]  AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 50#[L34-1, $Ultimate##0]true [88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0)  InVars {}  OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1}  AuxVars[]  AssignedVars[thread1Thread1of1ForFork0_i] 52#[L51-1, L34-1]true 
[2023-10-12 17:36:57,972 INFO  L750   eck$LassoCheckResult]: Loop: 52#[L51-1, L34-1]true [137] L51-1-->L51-1: Formula: (and (= v_thread1Thread1of1ForFork0_i_25 (+ v_thread1Thread1of1ForFork0_i_26 1)) (= (store v_A_32 v_thread1Thread1of1ForFork0_i_26 (let ((.cse0 (select v_A_32 v_thread1Thread1of1ForFork0_i_26))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_31) (< v_thread1Thread1of1ForFork0_i_26 v_N_28))  InVars {A=v_A_32, N=v_N_28, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_26}  OutVars{A=v_A_31, N=v_N_28, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_25}  AuxVars[]  AssignedVars[A, thread1Thread1of1ForFork0_i] 52#[L51-1, L34-1]true 
[2023-10-12 17:36:57,978 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:36:57,978 INFO  L85        PathProgramCache]: Analyzing trace with hash 113176, now seen corresponding path program 1 times
[2023-10-12 17:36:57,984 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:36:57,985 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179287150]
[2023-10-12 17:36:57,985 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:36:57,985 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:36:58,042 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:58,043 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:36:58,050 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:58,061 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:36:58,065 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:36:58,065 INFO  L85        PathProgramCache]: Analyzing trace with hash 168, now seen corresponding path program 1 times
[2023-10-12 17:36:58,065 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:36:58,065 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568364266]
[2023-10-12 17:36:58,065 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:36:58,066 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:36:58,078 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:58,078 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:36:58,090 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:58,093 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:36:58,094 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:36:58,094 INFO  L85        PathProgramCache]: Analyzing trace with hash 3508593, now seen corresponding path program 1 times
[2023-10-12 17:36:58,095 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:36:58,095 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653655927]
[2023-10-12 17:36:58,095 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:36:58,095 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:36:58,111 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:58,111 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:36:58,123 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:58,127 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:36:58,217 INFO  L210          LassoAnalysis]: Preferences:
[2023-10-12 17:36:58,218 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2023-10-12 17:36:58,218 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2023-10-12 17:36:58,218 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2023-10-12 17:36:58,218 INFO  L129   ssoRankerPreferences]: Use exernal solver: false
[2023-10-12 17:36:58,218 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:36:58,218 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2023-10-12 17:36:58,218 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2023-10-12 17:36:58,219 INFO  L133   ssoRankerPreferences]: Filename of dumped script: map-aggr-update3.bpl_BEv2_Iteration1_Lasso
[2023-10-12 17:36:58,219 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2023-10-12 17:36:58,219 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2023-10-12 17:36:58,241 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,253 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,309 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2023-10-12 17:36:58,311 INFO  L490          LassoAnalysis]: Using template 'affine'.
[2023-10-12 17:36:58,312 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:36:58,312 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-10-12 17:36:58,330 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,334 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,335 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,342 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2023-10-12 17:36:58,342 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2023-10-12 17:36:58,342 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2023-10-12 17:36:58,342 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2023-10-12 17:36:58,347 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2023-10-12 17:36:58,347 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2023-10-12 17:36:58,363 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2023-10-12 17:36:58,370 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,372 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:36:58,373 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-10-12 17:36:58,385 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,390 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,420 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,428 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2023-10-12 17:36:58,428 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2023-10-12 17:36:58,428 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2023-10-12 17:36:58,428 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2023-10-12 17:36:58,431 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2023-10-12 17:36:58,432 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2023-10-12 17:36:58,446 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2023-10-12 17:36:58,454 INFO  L443   ModelExtractionUtils]: Simplification made 4 calls to the SMT solver.
[2023-10-12 17:36:58,454 INFO  L444   ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero.
[2023-10-12 17:36:58,456 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:36:58,456 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-10-12 17:36:58,458 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,459 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,466 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2023-10-12 17:36:58,488 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2023-10-12 17:36:58,488 INFO  L513          LassoAnalysis]: Proved termination.
[2023-10-12 17:36:58,488 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,500 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,503 INFO  L156   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2023-10-12 17:36:58,531 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:36:58,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-12 17:36:58,539 INFO  L262         TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-10-12 17:36:58,539 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-10-12 17:36:58,553 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-12 17:36:58,554 WARN  L260         TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-12 17:36:58,555 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-10-12 17:36:58,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-12 17:36:58,585 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:58,675 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:58,680 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:58,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions.
[2023-10-12 17:36:58,686 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 3 letters. Loop has 1 letters.
[2023-10-12 17:36:58,687 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2023-10-12 17:36:58,687 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 4 letters. Loop has 1 letters.
[2023-10-12 17:36:58,687 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2023-10-12 17:36:58,687 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 3 letters. Loop has 2 letters.
[2023-10-12 17:36:58,688 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2023-10-12 17:36:58,688 INFO  L430   stractBuchiCegarLoop]: Abstraction has has 29 places, 72 transitions, 360 flow
[2023-10-12 17:36:58,689 INFO  L337   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2023-10-12 17:36:58,689 INFO  L67            RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 72 transitions, 360 flow
[2023-10-12 17:36:58,697 ERROR L47    etriNetUnfolderRabin]: [1:1A:[83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3))  InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7}  OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7}  AuxVars[]  AssignedVars[][38], 2:2A:[114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14}  AuxVars[]  AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i][34], 5:3A:[117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2))  InVars {}  OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2}  AuxVars[]  AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1][14], 16:4A:[134] $Ultimate##0-->L65-1: Formula: (and (= (+ v_thread2Thread1of1ForFork1_cnt_23 1) 0) (= v_thread2Thread1of1ForFork1_j_39 0))  InVars {}  OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_39, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_23}  AuxVars[]  AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_cnt][42]][18:5A:[141] L65-1-->L65-1: Formula: (and (let ((.cse0 (= (select v_A_39 v_thread2Thread1of1ForFork1_j_60) 0)) (.cse1 (< v_thread2Thread1of1ForFork1_j_60 v_N_36))) (or (and .cse0 (= v_thread2Thread1of1ForFork1_cnt_42 (+ v_thread2Thread1of1ForFork1_cnt_43 1)) .cse1) (and (= v_thread2Thread1of1ForFork1_cnt_43 v_thread2Thread1of1ForFork1_cnt_42) (not .cse0) .cse1))) (let ((.cse2 (= v_thread2Thread1of1ForFork1_j_59 (+ v_thread2Thread1of1ForFork1_j_60 1))) (.cse3 (select v_B_29 v_thread2Thread1of1ForFork1_j_60))) (or (and .cse2 (= v_thread2Thread1of1ForFork1_cnt_42 v_thread2Thread1of1ForFork1_cnt_41) (<= .cse3 0)) (and .cse2 (< 0 .cse3) (= v_thread2Thread1of1ForFork1_cnt_41 (+ v_thread2Thread1of1ForFork1_cnt_42 1))))))  InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_60, A=v_A_39, N=v_N_36, B=v_B_29, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_43}  OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_59, A=v_A_39, N=v_N_36, B=v_B_29, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_41}  AuxVars[v_thread2Thread1of1ForFork1_cnt_42]  AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_cnt][70]]
[2023-10-12 17:36:58,698 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-10-12 17:36:58,698 INFO  L124   PetriNetUnfolderBase]: 8/17 cut-off events.
[2023-10-12 17:36:58,698 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2023-10-12 17:36:58,698 INFO  L72            RabinIsEmpty]: Finished rabinIsEmpty language is not empty
[2023-10-12 17:36:58,699 INFO  L748   eck$LassoCheckResult]: Stem: 46#[$Ultimate##0]true [83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3))  InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7}  OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7}  AuxVars[]  AssignedVars[] 48#[L34]true [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14}  AuxVars[]  AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 50#[L34-1, $Ultimate##0]true [117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2))  InVars {}  OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2}  AuxVars[]  AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] 92#[$Ultimate##0, $Ultimate##0, L35]true [134] $Ultimate##0-->L65-1: Formula: (and (= (+ v_thread2Thread1of1ForFork1_cnt_23 1) 0) (= v_thread2Thread1of1ForFork1_j_39 0))  InVars {}  OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_39, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_23}  AuxVars[]  AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_cnt] 94#[$Ultimate##0, L65-1, L35]true 
[2023-10-12 17:36:58,699 INFO  L750   eck$LassoCheckResult]: Loop: 94#[$Ultimate##0, L65-1, L35]true [141] L65-1-->L65-1: Formula: (and (let ((.cse0 (= (select v_A_39 v_thread2Thread1of1ForFork1_j_60) 0)) (.cse1 (< v_thread2Thread1of1ForFork1_j_60 v_N_36))) (or (and .cse0 (= v_thread2Thread1of1ForFork1_cnt_42 (+ v_thread2Thread1of1ForFork1_cnt_43 1)) .cse1) (and (= v_thread2Thread1of1ForFork1_cnt_43 v_thread2Thread1of1ForFork1_cnt_42) (not .cse0) .cse1))) (let ((.cse2 (= v_thread2Thread1of1ForFork1_j_59 (+ v_thread2Thread1of1ForFork1_j_60 1))) (.cse3 (select v_B_29 v_thread2Thread1of1ForFork1_j_60))) (or (and .cse2 (= v_thread2Thread1of1ForFork1_cnt_42 v_thread2Thread1of1ForFork1_cnt_41) (<= .cse3 0)) (and .cse2 (< 0 .cse3) (= v_thread2Thread1of1ForFork1_cnt_41 (+ v_thread2Thread1of1ForFork1_cnt_42 1))))))  InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_60, A=v_A_39, N=v_N_36, B=v_B_29, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_43}  OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_59, A=v_A_39, N=v_N_36, B=v_B_29, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_41}  AuxVars[v_thread2Thread1of1ForFork1_cnt_42]  AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_cnt] 94#[$Ultimate##0, L65-1, L35]true 
[2023-10-12 17:36:58,700 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:36:58,700 INFO  L85        PathProgramCache]: Analyzing trace with hash 3509489, now seen corresponding path program 1 times
[2023-10-12 17:36:58,700 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:36:58,701 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839890578]
[2023-10-12 17:36:58,702 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:36:58,703 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:36:58,707 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:58,707 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:36:58,708 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:58,709 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:36:58,710 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:36:58,710 INFO  L85        PathProgramCache]: Analyzing trace with hash 172, now seen corresponding path program 1 times
[2023-10-12 17:36:58,710 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:36:58,710 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169749944]
[2023-10-12 17:36:58,710 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:36:58,710 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:36:58,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:58,716 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:36:58,719 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:58,720 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:36:58,720 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:36:58,720 INFO  L85        PathProgramCache]: Analyzing trace with hash 108794300, now seen corresponding path program 1 times
[2023-10-12 17:36:58,720 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:36:58,720 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208344282]
[2023-10-12 17:36:58,721 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:36:58,721 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:36:58,726 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:58,726 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:36:58,730 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:58,731 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:36:58,870 INFO  L210          LassoAnalysis]: Preferences:
[2023-10-12 17:36:58,870 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2023-10-12 17:36:58,870 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2023-10-12 17:36:58,871 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2023-10-12 17:36:58,871 INFO  L129   ssoRankerPreferences]: Use exernal solver: false
[2023-10-12 17:36:58,871 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:36:58,871 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2023-10-12 17:36:58,871 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2023-10-12 17:36:58,871 INFO  L133   ssoRankerPreferences]: Filename of dumped script: map-aggr-update3.bpl_BEv2_Iteration2_Lasso
[2023-10-12 17:36:58,871 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2023-10-12 17:36:58,871 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2023-10-12 17:36:58,873 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,938 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,940 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,942 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,945 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,124 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2023-10-12 17:36:59,124 INFO  L490          LassoAnalysis]: Using template 'affine'.
[2023-10-12 17:36:59,124 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:36:59,124 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-10-12 17:36:59,125 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,168 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,169 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,175 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2023-10-12 17:36:59,175 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2023-10-12 17:36:59,175 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2023-10-12 17:36:59,175 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2023-10-12 17:36:59,178 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2023-10-12 17:36:59,178 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2023-10-12 17:36:59,191 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2023-10-12 17:36:59,197 INFO  L443   ModelExtractionUtils]: Simplification made 5 calls to the SMT solver.
[2023-10-12 17:36:59,197 INFO  L444   ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero.
[2023-10-12 17:36:59,197 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-10-12 17:36:59,197 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-10-12 17:36:59,235 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,236 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,237 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2023-10-12 17:36:59,255 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2023-10-12 17:36:59,256 INFO  L513          LassoAnalysis]: Proved termination.
[2023-10-12 17:36:59,256 INFO  L515          LassoAnalysis]: Termination argument consisting of:
Ranking function f(thread2Thread1of1ForFork1_j, N) = -1*thread2Thread1of1ForFork1_j + 1*N
Supporting invariants []
[2023-10-12 17:36:59,261 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,262 INFO  L156   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2023-10-12 17:36:59,272 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:36:59,280 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-12 17:36:59,281 INFO  L262         TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-10-12 17:36:59,281 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-10-12 17:36:59,288 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-12 17:36:59,289 WARN  L260         TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-12 17:36:59,289 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-10-12 17:36:59,289 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,290 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,380 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,381 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,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions.
[2023-10-12 17:36:59,383 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 168 transitions. Stem has 4 letters. Loop has 1 letters.
[2023-10-12 17:36:59,384 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2023-10-12 17:36:59,384 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 168 transitions. Stem has 5 letters. Loop has 1 letters.
[2023-10-12 17:36:59,384 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2023-10-12 17:36:59,384 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 168 transitions. Stem has 4 letters. Loop has 2 letters.
[2023-10-12 17:36:59,384 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2023-10-12 17:36:59,384 INFO  L430   stractBuchiCegarLoop]: Abstraction has has 33 places, 288 transitions, 2016 flow
[2023-10-12 17:36:59,384 INFO  L337   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2023-10-12 17:36:59,384 INFO  L67            RabinIsEmpty]: Start rabinIsEmpty. Operand has 33 places, 288 transitions, 2016 flow
[2023-10-12 17:36:59,398 ERROR L47    etriNetUnfolderRabin]: [1:1A:[83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3))  InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7}  OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7}  AuxVars[]  AssignedVars[][152], 2:2A:[114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14}  AuxVars[]  AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i][136], 5:3A:[117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2))  InVars {}  OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2}  AuxVars[]  AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1][56], 15:4A:[120] L35-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2))  InVars {}  OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_12}  AuxVars[]  AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k][88], 36:5A:[106] $Ultimate##0-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0)  InVars {}  OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1}  AuxVars[]  AssignedVars[thread3Thread1of1ForFork2_k][72]][37:6A:[138] L83-1-->L83-1: Formula: (and (= (store v_B_26 v_thread3Thread1of1ForFork2_k_24 v_thread3Thread1of1ForFork2_k_24) v_B_25) (< v_thread3Thread1of1ForFork2_k_24 v_N_32) (= v_thread3Thread1of1ForFork2_k_23 0))  InVars {N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_24, B=v_B_26}  OutVars{N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_23, B=v_B_25}  AuxVars[]  AssignedVars[thread3Thread1of1ForFork2_k, B][248]]
[2023-10-12 17:36:59,398 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-10-12 17:36:59,398 INFO  L124   PetriNetUnfolderBase]: 21/36 cut-off events.
[2023-10-12 17:36:59,398 INFO  L125   PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES.
[2023-10-12 17:36:59,398 INFO  L72            RabinIsEmpty]: Finished rabinIsEmpty language is not empty
[2023-10-12 17:36:59,400 INFO  L748   eck$LassoCheckResult]: Stem: 46#[$Ultimate##0]true [83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3))  InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7}  OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7}  AuxVars[]  AssignedVars[] 48#[L34]true [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14}  AuxVars[]  AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 50#[L34-1, $Ultimate##0]true [117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2))  InVars {}  OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2}  AuxVars[]  AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] 92#[$Ultimate##0, $Ultimate##0, L35]true [120] L35-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2))  InVars {}  OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_12}  AuxVars[]  AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k] 132#[$Ultimate##0, $Ultimate##0, L36, $Ultimate##0]true [106] $Ultimate##0-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0)  InVars {}  OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1}  AuxVars[]  AssignedVars[thread3Thread1of1ForFork2_k] 134#[$Ultimate##0, L83-1, $Ultimate##0, L36]true 
[2023-10-12 17:36:59,400 INFO  L750   eck$LassoCheckResult]: Loop: 134#[$Ultimate##0, L83-1, $Ultimate##0, L36]true [138] L83-1-->L83-1: Formula: (and (= (store v_B_26 v_thread3Thread1of1ForFork2_k_24 v_thread3Thread1of1ForFork2_k_24) v_B_25) (< v_thread3Thread1of1ForFork2_k_24 v_N_32) (= v_thread3Thread1of1ForFork2_k_23 0))  InVars {N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_24, B=v_B_26}  OutVars{N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_23, B=v_B_25}  AuxVars[]  AssignedVars[thread3Thread1of1ForFork2_k, B] 134#[$Ultimate##0, L83-1, $Ultimate##0, L36]true 
[2023-10-12 17:36:59,400 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:36:59,400 INFO  L85        PathProgramCache]: Analyzing trace with hash 108793831, now seen corresponding path program 1 times
[2023-10-12 17:36:59,400 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:36:59,401 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658537983]
[2023-10-12 17:36:59,401 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:36:59,401 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:36:59,409 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:59,409 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:36:59,412 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:59,413 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:36:59,413 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:36:59,413 INFO  L85        PathProgramCache]: Analyzing trace with hash 169, now seen corresponding path program 1 times
[2023-10-12 17:36:59,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:36:59,413 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341973724]
[2023-10-12 17:36:59,413 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:36:59,414 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:36:59,416 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:59,416 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:36:59,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:59,418 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:36:59,418 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-12 17:36:59,418 INFO  L85        PathProgramCache]: Analyzing trace with hash -922358397, now seen corresponding path program 1 times
[2023-10-12 17:36:59,418 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-12 17:36:59,418 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019759350]
[2023-10-12 17:36:59,418 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-12 17:36:59,418 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-12 17:36:59,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:59,422 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:36:59,424 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:59,425 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-12 17:36:59,481 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:59,482 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-12 17:36:59,484 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-12 17:36:59,498 INFO  L201        PluginConnector]: Adding new model map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:36:59 BoogieIcfgContainer
[2023-10-12 17:36:59,498 INFO  L131        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2023-10-12 17:36:59,499 INFO  L158              Benchmark]: Toolchain (without parser) took 2402.49ms. Allocated memory was 232.8MB in the beginning and 292.6MB in the end (delta: 59.8MB). Free memory was 183.2MB in the beginning and 167.4MB in the end (delta: 15.8MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB.
[2023-10-12 17:36:59,499 INFO  L158              Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 232.8MB. Free memory was 184.4MB in the beginning and 184.2MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 8.0GB.
[2023-10-12 17:36:59,500 INFO  L158              Benchmark]: Boogie Procedure Inliner took 22.54ms. Allocated memory is still 232.8MB. Free memory was 183.2MB in the beginning and 181.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2023-10-12 17:36:59,500 INFO  L158              Benchmark]: Boogie Preprocessor took 13.71ms. Allocated memory is still 232.8MB. Free memory was 181.5MB in the beginning and 180.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2023-10-12 17:36:59,500 INFO  L158              Benchmark]: RCFGBuilder took 260.15ms. Allocated memory was 232.8MB in the beginning and 292.6MB in the end (delta: 59.8MB). Free memory was 180.5MB in the beginning and 258.7MB in the end (delta: -78.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB.
[2023-10-12 17:36:59,501 INFO  L158              Benchmark]: BuchiAutomizer took 2102.82ms. Allocated memory is still 292.6MB. Free memory was 258.7MB in the beginning and 167.4MB in the end (delta: 91.3MB). Peak memory consumption was 92.2MB. Max. memory is 8.0GB.
[2023-10-12 17:36:59,502 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 232.8MB. Free memory was 184.4MB in the beginning and 184.2MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 22.54ms. Allocated memory is still 232.8MB. Free memory was 183.2MB in the beginning and 181.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 13.71ms. Allocated memory is still 232.8MB. Free memory was 181.5MB in the beginning and 180.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
 * RCFGBuilder took 260.15ms. Allocated memory was 232.8MB in the beginning and 292.6MB in the end (delta: 59.8MB). Free memory was 180.5MB in the beginning and 258.7MB in the end (delta: -78.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB.
 * BuchiAutomizer took 2102.82ms. Allocated memory is still 292.6MB. Free memory was 258.7MB in the beginning and 167.4MB in the end (delta: 91.3MB). Peak memory consumption was 92.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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + N and consists of 3 locations. One deterministic module has affine ranking function N + -1 * j and consists of 3 locations.  The remainder module has 2016 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 2.0s and 3 iterations.  TraceHistogramMax:0. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. 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 [2, 0, 0, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 0/0	HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 219 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 217 mSDsluCounter, 160 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191 IncrementalHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 115 mSDtfsCounter, 191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown	LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks:   Lassos: inital78 mio100 ax100 hnf100 lsp175 ukn29 mio100 lsp87 div100 bol100 ite100 ukn100 eq167 hnf96 smp100 dnf191 smp70 tf100 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 51ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 0	LassoNonterminationAnalysisUnknown: 0	LassoNonterminationAnalysisTime: 0.0s	InitialAbstractionConstructionTime: 0.4s
  - TerminationAnalysisResult: Nontermination possible
    Buchi Automizer proved that your program is nonterminating for some inputs
  - LassoShapedNonTerminationArgument [Line: 83]: Nontermination argument in form of an infinite program execution.
    Nontermination argument in form of an infinite program execution.
Stem:
[L32]        0  assume 0 <= m && m < N;
       VAL      [N=1, m=0]
[L34]  FORK  0  fork 1 thread1();
       VAL      [N=1, m=0]
[L35]  FORK  0  fork 2, 2 thread2();
       VAL      [N=1, m=0]
[L36]  FORK  0  fork 3, 3, 3 thread3();
       VAL      [N=1, m=0]
[L82]        3  k := 0;
       VAL      [N=1, k=0, m=0]
Loop:
[L83]  COND TRUE  k < N
[L84]             B[k] := k;
[L85]             k := 0;
End of lasso representation.
  - StatisticsResult: NonterminationArgumentStatistics
    Fixpoint
  - NonterminatingLassoResult [Line: 83]: Nonterminating execution
    Found a nonterminating execution for the following lasso shaped sequence of statements.
Stem:
[L32]        0  assume 0 <= m && m < N;
       VAL      [N=1, m=0]
[L34]  FORK  0  fork 1 thread1();
       VAL      [N=1, m=0]
[L35]  FORK  0  fork 2, 2 thread2();
       VAL      [N=1, m=0]
[L36]  FORK  0  fork 3, 3, 3 thread3();
       VAL      [N=1, m=0]
[L82]        3  k := 0;
       VAL      [N=1, k=0, m=0]
Loop:
[L83]  COND TRUE  k < N
[L84]             B[k] := k;
[L85]             k := 0;
End of lasso representation.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 0.4s, 39 PlacesBefore, 25 PlacesAfterwards, 34 TransitionsBefore, 18 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 18 TotalNumberOfCompositions, 360 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 330, independent: 327, independent conditional: 0, independent unconditional: 327, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 249, independent: 246, independent conditional: 0, independent unconditional: 246, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 249, independent: 242, independent conditional: 0, independent unconditional: 242, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 330, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 249, unknown conditional: 0, unknown unconditional: 249] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
RESULT: Ultimate proved your program to be incorrect!
[2023-10-12 17:36:59,531 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,719 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,926 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0
Received shutdown request...