/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/equal-array-sums-locked.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:36:21,839 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:36:21,898 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:21,931 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:36:21,932 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:36:21,932 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:36:21,933 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:36:21,933 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:36:21,934 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:36:21,938 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:36:21,938 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:36:21,938 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:36:21,938 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:36:21,940 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:36:21,940 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:36:21,940 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:36:21,941 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:36:21,941 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:36:21,941 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:36:21,941 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:36:21,942 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:36:21,943 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:36:21,943 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:36:21,943 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:36:21,943 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:36:21,943 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:36:21,943 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:36:21,944 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:36:21,944 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:36:21,944 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:36:21,945 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:36:21,945 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:36:21,945 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:36:21,946 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:36:21,946 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:22,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:36:22,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:36:22,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:36:22,175 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:36:22,176 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:36:22,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/equal-array-sums-locked.bpl [2023-10-12 17:36:22,178 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/equal-array-sums-locked.bpl' [2023-10-12 17:36:22,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:36:22,197 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:36:22,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:22,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:36:22,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:36:22,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:22" (1/1) ... [2023-10-12 17:36:22,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:22" (1/1) ... [2023-10-12 17:36:22,224 INFO L138 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 20 [2023-10-12 17:36:22,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:22,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:36:22,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:36:22,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:36:22,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:22" (1/1) ... [2023-10-12 17:36:22,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:22" (1/1) ... [2023-10-12 17:36:22,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:22" (1/1) ... [2023-10-12 17:36:22,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:22" (1/1) ... [2023-10-12 17:36:22,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:22" (1/1) ... [2023-10-12 17:36:22,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:22" (1/1) ... [2023-10-12 17:36:22,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:22" (1/1) ... [2023-10-12 17:36:22,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:22" (1/1) ... [2023-10-12 17:36:22,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:36:22,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:36:22,244 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:36:22,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:36:22,245 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:22" (1/1) ... [2023-10-12 17:36:22,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:22,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:22,290 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:22,315 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:22,335 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:36:22,335 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:36:22,335 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:36:22,335 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:36:22,335 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:36:22,335 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:36:22,335 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:36:22,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:36:22,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:36:22,336 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:22,379 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:36:22,380 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:36:22,454 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:36:22,462 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:36:22,462 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:36:22,464 INFO L201 PluginConnector]: Adding new model equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:22 BoogieIcfgContainer [2023-10-12 17:36:22,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:36:22,465 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:36:22,465 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:36:22,467 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:36:22,468 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:22,468 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:22" (1/2) ... [2023-10-12 17:36:22,469 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@208671b1 and model type equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:36:22, skipping insertion in model container [2023-10-12 17:36:22,469 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:22,469 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:22" (2/2) ... [2023-10-12 17:36:22,470 INFO L332 chiAutomizerObserver]: Analyzing ICFG equal-array-sums-locked.bpl [2023-10-12 17:36:22,515 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:36:22,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 74 flow [2023-10-12 17:36:22,549 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2023-10-12 17:36:22,550 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:36:22,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 2/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2023-10-12 17:36:22,559 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 74 flow [2023-10-12 17:36:22,562 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 25 transitions, 62 flow [2023-10-12 17:36:22,564 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:36:22,575 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 25 transitions, 62 flow [2023-10-12 17:36:22,577 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 25 transitions, 62 flow [2023-10-12 17:36:22,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 25 transitions, 62 flow [2023-10-12 17:36:22,583 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2023-10-12 17:36:22,583 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:36:22,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 2/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2023-10-12 17:36:22,584 INFO L119 LiptonReduction]: Number of co-enabled transitions 160 [2023-10-12 17:36:22,802 INFO L134 LiptonReduction]: Checked pairs total: 162 [2023-10-12 17:36:22,803 INFO L136 LiptonReduction]: Total number of compositions: 10 [2023-10-12 17:36:22,814 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:36:22,814 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:36:22,814 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:36:22,815 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:36:22,815 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:36:22,815 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:36:22,815 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:36:22,815 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:36:22,815 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 20 places, 15 transitions, 42 flow [2023-10-12 17:36:22,818 ERROR L47 etriNetUnfolderRabin]: [1:1A:[97] $Ultimate##0-->L26: Formula: (and (= v_x_12 0) (= v_y_12 0)) InVars {} OutVars{y=v_y_12, x=v_x_12} AuxVars[] AssignedVars[y, x][11], 2:2A:[84] L26-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_14|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1, thread1Thread1of1ForFork0_thidvar0][5], 4:3A:[66] $Ultimate##0-->L40-1: Formula: (= |v_thread1Thread1of1ForFork0_i#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1][1]][7:4A:[99] L40-1-->L71: Formula: (and v_m_61 (= (+ (select v_A_9 |v_thread1Thread1of1ForFork0_i#1_23|) v_x_15) v_x_14) (< |v_thread1Thread1of1ForFork0_i#1_23| v_n_11) (not v_m_62)) InVars {A=v_A_9, thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_23|, n=v_n_11, m=v_m_62, x=v_x_15} OutVars{A=v_A_9, thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_23|, n=v_n_11, m=v_m_61, x=v_x_14} AuxVars[] AssignedVars[m, x][13], 8:5A:[92] L71-->L40-1: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_i#1_16| 1) |v_thread1Thread1of1ForFork0_i#1_15|) (not v_m_46)) InVars {thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_16|} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_15|, m=v_m_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1, m][12]] [2023-10-12 17:36:22,820 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:22,820 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-10-12 17:36:22,820 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:36:22,820 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:22,822 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:36:22,822 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 20 places, 15 transitions, 42 flow [2023-10-12 17:36:22,824 ERROR L47 etriNetUnfolderRabin]: [1:1A:[97] $Ultimate##0-->L26: Formula: (and (= v_x_12 0) (= v_y_12 0)) InVars {} OutVars{y=v_y_12, x=v_x_12} AuxVars[] AssignedVars[y, x][11], 2:2A:[84] L26-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_14|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1, thread1Thread1of1ForFork0_thidvar0][5], 4:3A:[66] $Ultimate##0-->L40-1: Formula: (= |v_thread1Thread1of1ForFork0_i#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1][1]][7:4A:[99] L40-1-->L71: Formula: (and v_m_61 (= (+ (select v_A_9 |v_thread1Thread1of1ForFork0_i#1_23|) v_x_15) v_x_14) (< |v_thread1Thread1of1ForFork0_i#1_23| v_n_11) (not v_m_62)) InVars {A=v_A_9, thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_23|, n=v_n_11, m=v_m_62, x=v_x_15} OutVars{A=v_A_9, thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_23|, n=v_n_11, m=v_m_61, x=v_x_14} AuxVars[] AssignedVars[m, x][13], 8:5A:[92] L71-->L40-1: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_i#1_16| 1) |v_thread1Thread1of1ForFork0_i#1_15|) (not v_m_46)) InVars {thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_16|} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_15|, m=v_m_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1, m][12]] [2023-10-12 17:36:22,824 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:22,824 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-10-12 17:36:22,824 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:36:22,824 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:22,831 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [97] $Ultimate##0-->L26: Formula: (and (= v_x_12 0) (= v_y_12 0)) InVars {} OutVars{y=v_y_12, x=v_x_12} AuxVars[] AssignedVars[y, x] 38#[L26]true [84] L26-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_14|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1, thread1Thread1of1ForFork0_thidvar0] 40#[L26-1, $Ultimate##0]true [66] $Ultimate##0-->L40-1: Formula: (= |v_thread1Thread1of1ForFork0_i#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1] 42#[L26-1, L40-1]true [2023-10-12 17:36:22,832 INFO L750 eck$LassoCheckResult]: Loop: 42#[L26-1, L40-1]true [99] L40-1-->L71: Formula: (and v_m_61 (= (+ (select v_A_9 |v_thread1Thread1of1ForFork0_i#1_23|) v_x_15) v_x_14) (< |v_thread1Thread1of1ForFork0_i#1_23| v_n_11) (not v_m_62)) InVars {A=v_A_9, thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_23|, n=v_n_11, m=v_m_62, x=v_x_15} OutVars{A=v_A_9, thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_23|, n=v_n_11, m=v_m_61, x=v_x_14} AuxVars[] AssignedVars[m, x] 45#[L71, L26-1]true [92] L71-->L40-1: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_i#1_16| 1) |v_thread1Thread1of1ForFork0_i#1_15|) (not v_m_46)) InVars {thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_16|} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_15|, m=v_m_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1, m] 42#[L26-1, L40-1]true [2023-10-12 17:36:22,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:22,836 INFO L85 PathProgramCache]: Analyzing trace with hash 125678, now seen corresponding path program 1 times [2023-10-12 17:36:22,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:22,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260600680] [2023-10-12 17:36:22,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:22,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:22,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:22,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:22,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:22,976 INFO L85 PathProgramCache]: Analyzing trace with hash 4122, now seen corresponding path program 1 times [2023-10-12 17:36:22,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:22,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752118673] [2023-10-12 17:36:22,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:22,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:22,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:23,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:23,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:23,003 INFO L85 PathProgramCache]: Analyzing trace with hash 120779719, now seen corresponding path program 1 times [2023-10-12 17:36:23,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:23,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894317486] [2023-10-12 17:36:23,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:23,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:23,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:23,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:23,123 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:23,123 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:23,123 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:23,123 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:23,124 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:23,124 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:23,124 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:23,124 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:23,124 INFO L133 ssoRankerPreferences]: Filename of dumped script: equal-array-sums-locked.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:36:23,124 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:23,124 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:23,135 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:23,147 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:23,153 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:23,169 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:23,224 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:23,226 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:23,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:23,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:23,230 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:23,231 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:23,233 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:23,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:23,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:23,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:23,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:23,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:23,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:23,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:23,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:23,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:36:23,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:23,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:23,280 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:23,282 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:23,284 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:23,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:23,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:23,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:23,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:23,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:23,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:23,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:23,318 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:23,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:23,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:23,320 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:23,322 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:23,323 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:23,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:23,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:23,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:23,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:23,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:23,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:23,349 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:23,355 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:36:23,355 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:36:23,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:23,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:23,358 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:23,359 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:23,360 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:23,382 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:36:23,382 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:23,382 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i#1, n) = -1*thread1Thread1of1ForFork0_i#1 + 1*n Supporting invariants [] [2023-10-12 17:36:23,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:36:23,399 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:23,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:23,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:23,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:23,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:23,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:23,450 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:23,475 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:36:23,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2023-10-12 17:36:23,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 189 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:36:23,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:23,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 189 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:36:23,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:23,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 189 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:36:23,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:23,615 INFO L430 stractBuchiCegarLoop]: Abstraction has has 26 places, 90 transitions, 432 flow [2023-10-12 17:36:23,616 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:36:23,618 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 90 transitions, 432 flow [2023-10-12 17:36:23,628 ERROR L47 etriNetUnfolderRabin]: [1:1A:[97] $Ultimate##0-->L26: Formula: (and (= v_x_12 0) (= v_y_12 0)) InVars {} OutVars{y=v_y_12, x=v_x_12} AuxVars[] AssignedVars[y, x][67], 2:2A:[84] L26-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_14|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1, thread1Thread1of1ForFork0_thidvar0][31], 3:3A:[87] L26-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_14|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][1], 6:4A:[74] $Ultimate##0-->L54-1: Formula: (= |v_thread2Thread1of1ForFork1_j#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j#1][37]][28:5A:[98] L54-1-->L71: Formula: (and (< |v_thread2Thread1of1ForFork1_j#1_23| v_n_9) v_m_57 (= v_y_14 (+ v_y_15 (select v_A_7 |v_thread2Thread1of1ForFork1_j#1_23|))) (not v_m_58)) InVars {A=v_A_7, n=v_n_9, m=v_m_58, y=v_y_15, thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_23|} OutVars{A=v_A_7, n=v_n_9, m=v_m_57, y=v_y_14, thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_23|} AuxVars[] AssignedVars[m, y][85], 29:6A:[91] L71-->L54-1: Formula: (and (= (+ |v_thread2Thread1of1ForFork1_j#1_18| 1) |v_thread2Thread1of1ForFork1_j#1_17|) (not v_m_35)) InVars {thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_18|} OutVars{m=v_m_35, thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_17|} AuxVars[] AssignedVars[m, thread2Thread1of1ForFork1_j#1][55]] [2023-10-12 17:36:23,632 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:23,632 INFO L124 PetriNetUnfolderBase]: 13/28 cut-off events. [2023-10-12 17:36:23,632 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:36:23,632 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:23,633 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [97] $Ultimate##0-->L26: Formula: (and (= v_x_12 0) (= v_y_12 0)) InVars {} OutVars{y=v_y_12, x=v_x_12} AuxVars[] AssignedVars[y, x] 38#[L26]true [84] L26-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_14|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1, thread1Thread1of1ForFork0_thidvar0] 40#[L26-1, $Ultimate##0]true [87] L26-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_14|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 90#[$Ultimate##0, L27, $Ultimate##0]true [74] $Ultimate##0-->L54-1: Formula: (= |v_thread2Thread1of1ForFork1_j#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j#1] 92#[L27, $Ultimate##0, L54-1]true [2023-10-12 17:36:23,633 INFO L750 eck$LassoCheckResult]: Loop: 92#[L27, $Ultimate##0, L54-1]true [98] L54-1-->L71: Formula: (and (< |v_thread2Thread1of1ForFork1_j#1_23| v_n_9) v_m_57 (= v_y_14 (+ v_y_15 (select v_A_7 |v_thread2Thread1of1ForFork1_j#1_23|))) (not v_m_58)) InVars {A=v_A_7, n=v_n_9, m=v_m_58, y=v_y_15, thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_23|} OutVars{A=v_A_7, n=v_n_9, m=v_m_57, y=v_y_14, thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_23|} AuxVars[] AssignedVars[m, y] 95#[L27, $Ultimate##0, L71]true [91] L71-->L54-1: Formula: (and (= (+ |v_thread2Thread1of1ForFork1_j#1_18| 1) |v_thread2Thread1of1ForFork1_j#1_17|) (not v_m_35)) InVars {thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_18|} OutVars{m=v_m_35, thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_17|} AuxVars[] AssignedVars[m, thread2Thread1of1ForFork1_j#1] 92#[L27, $Ultimate##0, L54-1]true [2023-10-12 17:36:23,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:23,634 INFO L85 PathProgramCache]: Analyzing trace with hash 3896743, now seen corresponding path program 1 times [2023-10-12 17:36:23,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:23,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368349108] [2023-10-12 17:36:23,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:23,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:23,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:23,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:23,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:23,648 INFO L85 PathProgramCache]: Analyzing trace with hash 4090, now seen corresponding path program 1 times [2023-10-12 17:36:23,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:23,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163363567] [2023-10-12 17:36:23,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:23,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:23,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:23,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:23,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:23,654 INFO L85 PathProgramCache]: Analyzing trace with hash -550194144, now seen corresponding path program 1 times [2023-10-12 17:36:23,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:23,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068256974] [2023-10-12 17:36:23,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:23,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:23,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:23,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:23,745 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:23,745 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:23,745 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:23,745 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:23,745 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:23,745 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:23,745 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:23,745 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:23,745 INFO L133 ssoRankerPreferences]: Filename of dumped script: equal-array-sums-locked.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:36:23,745 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:23,745 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:23,746 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:23,757 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:23,759 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:23,761 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:23,764 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:23,767 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:23,769 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:23,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:36:23,853 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:23,854 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:23,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:23,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:23,855 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:23,881 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:23,882 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:23,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:23,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:23,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:23,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:23,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:36:23,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:36:23,912 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:23,924 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:23,924 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:36:23,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:23,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:23,932 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:23,946 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:23,947 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:23,968 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:36:23,968 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:23,968 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, thread2Thread1of1ForFork1_j#1) = 1*n - 1*thread2Thread1of1ForFork1_j#1 Supporting invariants [] [2023-10-12 17:36:23,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:36:23,985 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:23,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:24,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:24,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:24,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:24,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:24,036 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:24,037 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:36:24,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:36:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2023-10-12 17:36:24,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 189 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:36:24,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:24,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 189 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:36:24,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:24,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 189 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:36:24,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:24,148 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 540 transitions, 3672 flow [2023-10-12 17:36:24,148 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:36:24,148 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 540 transitions, 3672 flow [2023-10-12 17:36:24,171 INFO L124 PetriNetUnfolderBase]: 38/73 cut-off events. [2023-10-12 17:36:24,171 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-10-12 17:36:24,171 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:36:24,176 INFO L201 PluginConnector]: Adding new model equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:36:24 BoogieIcfgContainer [2023-10-12 17:36:24,176 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:36:24,179 INFO L158 Benchmark]: Toolchain (without parser) took 1979.75ms. Allocated memory was 161.5MB in the beginning and 196.1MB in the end (delta: 34.6MB). Free memory was 111.7MB in the beginning and 152.6MB in the end (delta: -40.9MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:36:24,180 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.26ms. Allocated memory is still 161.5MB. Free memory is still 112.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:36:24,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.81ms. Allocated memory is still 161.5MB. Free memory was 111.7MB in the beginning and 109.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:36:24,181 INFO L158 Benchmark]: Boogie Preprocessor took 16.24ms. Allocated memory is still 161.5MB. Free memory was 109.7MB in the beginning and 108.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:36:24,181 INFO L158 Benchmark]: RCFGBuilder took 220.64ms. Allocated memory is still 161.5MB. Free memory was 108.6MB in the beginning and 129.5MB in the end (delta: -20.9MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2023-10-12 17:36:24,182 INFO L158 Benchmark]: BuchiAutomizer took 1711.27ms. Allocated memory was 161.5MB in the beginning and 196.1MB in the end (delta: 34.6MB). Free memory was 129.5MB in the beginning and 152.6MB in the end (delta: -23.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-10-12 17:36:24,186 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.26ms. Allocated memory is still 161.5MB. Free memory is still 112.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.81ms. Allocated memory is still 161.5MB. Free memory was 111.7MB in the beginning and 109.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.24ms. Allocated memory is still 161.5MB. Free memory was 109.7MB in the beginning and 108.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 220.64ms. Allocated memory is still 161.5MB. Free memory was 108.6MB in the beginning and 129.5MB in the end (delta: -20.9MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1711.27ms. Allocated memory was 161.5MB in the beginning and 196.1MB in the end (delta: 34.6MB). Free memory was 129.5MB in the beginning and 152.6MB in the end (delta: -23.0MB). Peak memory consumption was 11.5MB. 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). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * j + n and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 0.9s. 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 206 mSDsluCounter, 210 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 250 IncrementalHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 114 mSDtfsCounter, 250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital36 mio100 ax100 hnf100 lsp64 ukn91 mio100 lsp57 div100 bol100 ite100 ukn100 eq183 hnf95 smp100 dnf100 smp100 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 50ms 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.2s - 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.2s, 30 PlacesBefore, 20 PlacesAfterwards, 25 TransitionsBefore, 15 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 162 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 141, independent: 133, independent conditional: 0, independent unconditional: 133, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 106, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 106, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 141, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 106, unknown conditional: 0, unknown unconditional: 106] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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:36:24,202 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:36:24,404 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...