/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/regression/fork_in_loop.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:12:02,081 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:12:02,116 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:12:02,130 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:12:02,130 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:12:02,130 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:12:02,131 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:12:02,131 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:12:02,131 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:12:02,132 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:12:02,132 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:12:02,132 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:12:02,132 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:12:02,133 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:12:02,133 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:12:02,133 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:12:02,133 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:12:02,134 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:12:02,134 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:12:02,134 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:12:02,134 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:12:02,135 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:12:02,135 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:12:02,135 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:12:02,135 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:12:02,135 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:12:02,136 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:12:02,136 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:12:02,136 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:12:02,136 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:12:02,137 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:12:02,137 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:12:02,137 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:12:02,138 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:12:02,138 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_AUTOMATON [2023-10-12 17:12:02,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:12:02,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:12:02,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:12:02,350 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:12:02,351 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:12:02,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/fork_in_loop.bpl [2023-10-12 17:12:02,352 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/fork_in_loop.bpl' [2023-10-12 17:12:02,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:12:02,369 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:12:02,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:02,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:12:02,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:12:02,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:02" (1/1) ... [2023-10-12 17:12:02,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:02" (1/1) ... [2023-10-12 17:12:02,390 INFO L138 Inliner]: procedures = 2, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:12:02,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:02,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:12:02,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:12:02,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:12:02,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:02" (1/1) ... [2023-10-12 17:12:02,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:02" (1/1) ... [2023-10-12 17:12:02,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:02" (1/1) ... [2023-10-12 17:12:02,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:02" (1/1) ... [2023-10-12 17:12:02,401 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:02" (1/1) ... [2023-10-12 17:12:02,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:02" (1/1) ... [2023-10-12 17:12:02,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:02" (1/1) ... [2023-10-12 17:12:02,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:02" (1/1) ... [2023-10-12 17:12:02,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:12:02,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:12:02,406 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:12:02,406 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:12:02,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:02" (1/1) ... [2023-10-12 17:12:02,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:02,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:02,441 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:12:02,461 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:12:02,469 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2023-10-12 17:12:02,469 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2023-10-12 17:12:02,469 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2023-10-12 17:12:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:12:02,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:12:02,470 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:12:02,502 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:12:02,503 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:12:02,559 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:12:02,563 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:12:02,563 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:12:02,564 INFO L201 PluginConnector]: Adding new model fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:02 BoogieIcfgContainer [2023-10-12 17:12:02,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:12:02,565 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:12:02,565 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:12:02,567 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:12:02,567 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:02,567 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:02" (1/2) ... [2023-10-12 17:12:02,568 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45945d39 and model type fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:12:02, skipping insertion in model container [2023-10-12 17:12:02,568 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:02,568 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:02" (2/2) ... [2023-10-12 17:12:02,569 INFO L332 chiAutomizerObserver]: Analyzing ICFG fork_in_loop.bpl [2023-10-12 17:12:02,600 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-10-12 17:12:02,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 82 flow [2023-10-12 17:12:02,630 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2023-10-12 17:12:02,630 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:12:02,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 2/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2023-10-12 17:12:02,633 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 27 transitions, 82 flow [2023-10-12 17:12:02,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 20 transitions, 56 flow [2023-10-12 17:12:02,638 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:12:02,664 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 20 transitions, 56 flow [2023-10-12 17:12:02,666 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 20 transitions, 56 flow [2023-10-12 17:12:02,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 20 transitions, 56 flow [2023-10-12 17:12:02,671 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2023-10-12 17:12:02,671 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:12:02,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 2/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2023-10-12 17:12:02,672 INFO L119 LiptonReduction]: Number of co-enabled transitions 44 [2023-10-12 17:12:02,709 INFO L134 LiptonReduction]: Checked pairs total: 62 [2023-10-12 17:12:02,709 INFO L136 LiptonReduction]: Total number of compositions: 3 [2023-10-12 17:12:02,726 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:12:02,726 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:12:02,726 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:12:02,726 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:12:02,726 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:12:02,726 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:12:02,726 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:12:02,727 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:12:02,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:12:02,750 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:12:02,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:02,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:02,753 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2023-10-12 17:12:02,754 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:02,754 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:12:02,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 27 states, but on-demand construction may add more states [2023-10-12 17:12:02,755 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:12:02,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:02,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:02,756 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2023-10-12 17:12:02,756 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:02,759 INFO L748 eck$LassoCheckResult]: Stem: 30#[$Ultimate##0]don't care [41] $Ultimate##0-->L22-1: Formula: (= 1 v_ULTIMATE.start_x_1) InVars {} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_1} AuxVars[] AssignedVars[ULTIMATE.start_x] 33#[L22-1]don't care [28] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[] 35#[L23]don't care [53] L23-->$Ultimate##0: Formula: (and (= v_fooThread1of1ForFork1_thidvar0_2 v_ULTIMATE.start_x_16) (= v_fooThread1of1ForFork1_i_2 v_ULTIMATE.start_x_16)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_16} OutVars{fooThread1of1ForFork1_y=v_fooThread1of1ForFork1_y_4, fooThread1of1ForFork1_i=v_fooThread1of1ForFork1_i_2, fooThread1of1ForFork1_thidvar0=v_fooThread1of1ForFork1_thidvar0_2, ULTIMATE.start_x=v_ULTIMATE.start_x_16} AuxVars[] AssignedVars[fooThread1of1ForFork1_y, fooThread1of1ForFork1_i, fooThread1of1ForFork1_thidvar0] 39#[$Ultimate##0, L23-1]don't care [35] L23-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_x_4) v_ULTIMATE.start_x_3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_3} AuxVars[] AssignedVars[ULTIMATE.start_x] 41#[$Ultimate##0, L22-1]don't care [28] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[] 45#[$Ultimate##0, L23]don't care [51] L23-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 51#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]don't care [2023-10-12 17:12:02,759 INFO L750 eck$LassoCheckResult]: Loop: 51#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]don't care [52] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 51#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]don't care [2023-10-12 17:12:02,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:02,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2088770937, now seen corresponding path program 1 times [2023-10-12 17:12:02,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:02,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989609044] [2023-10-12 17:12:02,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:02,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:02,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:02,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989609044] [2023-10-12 17:12:02,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989609044] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:02,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:02,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:12:02,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134394708] [2023-10-12 17:12:02,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:02,930 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:12:02,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:02,930 INFO L85 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 1 times [2023-10-12 17:12:02,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:02,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38413315] [2023-10-12 17:12:02,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:02,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:02,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:02,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:02,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:02,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:12:02,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:12:02,978 INFO L87 Difference]: Start difference. First operand currently 27 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 1.5) 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:12:03,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:03,022 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2023-10-12 17:12:03,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2023-10-12 17:12:03,024 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2023-10-12 17:12:03,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 25 transitions. [2023-10-12 17:12:03,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-10-12 17:12:03,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-10-12 17:12:03,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2023-10-12 17:12:03,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:12:03,028 INFO L219 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2023-10-12 17:12:03,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2023-10-12 17:12:03,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-10-12 17:12:03,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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:12:03,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2023-10-12 17:12:03,051 INFO L241 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2023-10-12 17:12:03,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:12:03,055 INFO L430 stractBuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2023-10-12 17:12:03,055 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:12:03,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2023-10-12 17:12:03,056 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2023-10-12 17:12:03,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:03,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:03,056 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:03,056 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:03,057 INFO L748 eck$LassoCheckResult]: Stem: 154#[$Ultimate##0]don't care [41] $Ultimate##0-->L22-1: Formula: (= 1 v_ULTIMATE.start_x_1) InVars {} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_1} AuxVars[] AssignedVars[ULTIMATE.start_x] 122#[L22-1]don't care [28] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[] 124#[L23]don't care [53] L23-->$Ultimate##0: Formula: (and (= v_fooThread1of1ForFork1_thidvar0_2 v_ULTIMATE.start_x_16) (= v_fooThread1of1ForFork1_i_2 v_ULTIMATE.start_x_16)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_16} OutVars{fooThread1of1ForFork1_y=v_fooThread1of1ForFork1_y_4, fooThread1of1ForFork1_i=v_fooThread1of1ForFork1_i_2, fooThread1of1ForFork1_thidvar0=v_fooThread1of1ForFork1_thidvar0_2, ULTIMATE.start_x=v_ULTIMATE.start_x_16} AuxVars[] AssignedVars[fooThread1of1ForFork1_y, fooThread1of1ForFork1_i, fooThread1of1ForFork1_thidvar0] 126#[$Ultimate##0, L23-1]don't care [35] L23-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_x_4) v_ULTIMATE.start_x_3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_3} AuxVars[] AssignedVars[ULTIMATE.start_x] 128#[$Ultimate##0, L22-1]don't care [60] L22-1-->L27: Formula: (and (= v_ULTIMATE.start_x_21 1) (<= 2 v_ULTIMATE.start_x_22)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_22} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_21} AuxVars[] AssignedVars[ULTIMATE.start_x] 148#[L27, $Ultimate##0]don't care [61] $Ultimate##0-->fooEXIT: Formula: (= v_fooThread1of1ForFork1_y_5 4) InVars {} OutVars{fooThread1of1ForFork1_y=v_fooThread1of1ForFork1_y_5} AuxVars[] AssignedVars[fooThread1of1ForFork1_y] 132#[L27, fooEXIT]don't care [54] fooEXIT-->L28: Formula: (= v_fooThread1of1ForFork1_thidvar0_4 v_ULTIMATE.start_x_18) InVars {fooThread1of1ForFork1_thidvar0=v_fooThread1of1ForFork1_thidvar0_4, ULTIMATE.start_x=v_ULTIMATE.start_x_18} OutVars{fooThread1of1ForFork1_thidvar0=v_fooThread1of1ForFork1_thidvar0_4, ULTIMATE.start_x=v_ULTIMATE.start_x_18} AuxVars[] AssignedVars[] 134#[L28]don't care [40] L28-->L29: Formula: (< v_ULTIMATE.start_x_7 3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_7} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_7} AuxVars[] AssignedVars[] 142#[L29]don't care [50] L29-->$Ultimate##0: Formula: (and (= v_fooThread1of1ForFork0_thidvar0_2 v_ULTIMATE.start_x_13) (= v_fooThread1of1ForFork0_i_2 v_ULTIMATE.start_x_13)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_13} OutVars{fooThread1of1ForFork0_thidvar0=v_fooThread1of1ForFork0_thidvar0_2, fooThread1of1ForFork0_y=v_fooThread1of1ForFork0_y_4, fooThread1of1ForFork0_i=v_fooThread1of1ForFork0_i_2, ULTIMATE.start_x=v_ULTIMATE.start_x_13} AuxVars[] AssignedVars[fooThread1of1ForFork0_thidvar0, fooThread1of1ForFork0_y, fooThread1of1ForFork0_i] 144#[L29-1, $Ultimate##0]don't care [32] L29-1-->L28: Formula: (= (+ 1 v_ULTIMATE.start_x_9) v_ULTIMATE.start_x_8) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_9} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_8} AuxVars[] AssignedVars[ULTIMATE.start_x] 136#[L28, $Ultimate##0]don't care [40] L28-->L29: Formula: (< v_ULTIMATE.start_x_7 3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_7} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_7} AuxVars[] AssignedVars[] 138#[L29, $Ultimate##0]don't care [48] L29-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 118#[ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]don't care [2023-10-12 17:12:03,057 INFO L750 eck$LassoCheckResult]: Loop: 118#[ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]don't care [49] ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 118#[ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]don't care [2023-10-12 17:12:03,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:03,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1650663285, now seen corresponding path program 1 times [2023-10-12 17:12:03,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:03,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424385561] [2023-10-12 17:12:03,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:03,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:03,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:03,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:03,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:03,084 INFO L85 PathProgramCache]: Analyzing trace with hash 80, now seen corresponding path program 1 times [2023-10-12 17:12:03,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:03,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206457819] [2023-10-12 17:12:03,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:03,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:03,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:03,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:03,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:03,088 INFO L85 PathProgramCache]: Analyzing trace with hash 369045766, now seen corresponding path program 1 times [2023-10-12 17:12:03,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:03,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17921976] [2023-10-12 17:12:03,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:03,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:03,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:03,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:03,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:03,226 WARN L148 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-10-12 17:12:03,236 INFO L144 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2023-10-12 17:12:03,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 39 transitions, 138 flow [2023-10-12 17:12:03,255 INFO L124 PetriNetUnfolderBase]: 18/115 cut-off events. [2023-10-12 17:12:03,255 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-10-12 17:12:03,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 115 events. 18/115 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 411 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 86. Up to 15 conditions per place. [2023-10-12 17:12:03,256 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 39 transitions, 138 flow [2023-10-12 17:12:03,257 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 37 transitions, 128 flow [2023-10-12 17:12:03,258 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:12:03,258 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 37 transitions, 128 flow [2023-10-12 17:12:03,258 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 37 transitions, 128 flow [2023-10-12 17:12:03,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 37 transitions, 128 flow [2023-10-12 17:12:03,272 INFO L124 PetriNetUnfolderBase]: 18/115 cut-off events. [2023-10-12 17:12:03,272 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-10-12 17:12:03,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 115 events. 18/115 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 409 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 86. Up to 15 conditions per place. [2023-10-12 17:12:03,274 INFO L119 LiptonReduction]: Number of co-enabled transitions 336 [2023-10-12 17:12:03,314 INFO L134 LiptonReduction]: Checked pairs total: 674 [2023-10-12 17:12:03,314 INFO L136 LiptonReduction]: Total number of compositions: 6 [2023-10-12 17:12:03,315 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:12:03,315 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:12:03,315 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:12:03,315 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:12:03,316 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:12:03,316 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:12:03,316 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:12:03,316 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:12:03,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:12:03,365 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2023-10-12 17:12:03,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:03,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:03,365 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1] [2023-10-12 17:12:03,365 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:03,365 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:12:03,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 242 states, but on-demand construction may add more states [2023-10-12 17:12:03,399 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2023-10-12 17:12:03,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:03,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:03,400 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1] [2023-10-12 17:12:03,400 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:03,400 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]don't care [78] $Ultimate##0-->L22-1: Formula: (= 1 v_ULTIMATE.start_x_1) InVars {} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_1} AuxVars[] AssignedVars[ULTIMATE.start_x] 43#[L22-1]don't care [65] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[] 45#[L23]don't care [95] L23-->$Ultimate##0: Formula: (and (= v_fooThread1of2ForFork1_i_2 v_ULTIMATE.start_x_37) (= v_ULTIMATE.start_x_37 v_fooThread1of2ForFork1_thidvar0_2)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_37} OutVars{fooThread1of2ForFork1_y=v_fooThread1of2ForFork1_y_4, fooThread1of2ForFork1_i=v_fooThread1of2ForFork1_i_2, ULTIMATE.start_x=v_ULTIMATE.start_x_37, fooThread1of2ForFork1_thidvar0=v_fooThread1of2ForFork1_thidvar0_2} AuxVars[] AssignedVars[fooThread1of2ForFork1_y, fooThread1of2ForFork1_i, fooThread1of2ForFork1_thidvar0] 49#[L23-1, $Ultimate##0]don't care [72] L23-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_x_4) v_ULTIMATE.start_x_3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_3} AuxVars[] AssignedVars[ULTIMATE.start_x] 51#[$Ultimate##0, L22-1]don't care [65] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[] 55#[$Ultimate##0, L23]don't care [96] L23-->$Ultimate##0: Formula: (and (= v_fooThread2of2ForFork1_i_2 v_ULTIMATE.start_x_40) (= v_fooThread2of2ForFork1_thidvar0_2 v_ULTIMATE.start_x_40)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_40} OutVars{fooThread2of2ForFork1_thidvar0=v_fooThread2of2ForFork1_thidvar0_2, ULTIMATE.start_x=v_ULTIMATE.start_x_40, fooThread2of2ForFork1_y=v_fooThread2of2ForFork1_y_4, fooThread2of2ForFork1_i=v_fooThread2of2ForFork1_i_2} AuxVars[] AssignedVars[fooThread2of2ForFork1_thidvar0, fooThread2of2ForFork1_y, fooThread2of2ForFork1_i] 61#[$Ultimate##0, $Ultimate##0, L23-1]don't care [72] L23-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_x_4) v_ULTIMATE.start_x_3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_3} AuxVars[] AssignedVars[ULTIMATE.start_x] 69#[$Ultimate##0, L22-1, $Ultimate##0]don't care [65] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[] 79#[$Ultimate##0, $Ultimate##0, L23]don't care [93] L23-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 95#[$Ultimate##0, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]don't care [2023-10-12 17:12:03,400 INFO L750 eck$LassoCheckResult]: Loop: 95#[$Ultimate##0, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]don't care [94] ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 95#[$Ultimate##0, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]don't care [2023-10-12 17:12:03,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:03,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1587723320, now seen corresponding path program 1 times [2023-10-12 17:12:03,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:03,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678332120] [2023-10-12 17:12:03,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:12:03,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:03,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678332120] [2023-10-12 17:12:03,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678332120] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:03,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:03,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:12:03,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699207414] [2023-10-12 17:12:03,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:03,459 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:12:03,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:03,466 INFO L85 PathProgramCache]: Analyzing trace with hash 125, now seen corresponding path program 1 times [2023-10-12 17:12:03,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:03,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035586614] [2023-10-12 17:12:03,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:03,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:03,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:03,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:03,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:03,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:12:03,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:12:03,484 INFO L87 Difference]: Start difference. First operand currently 242 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:03,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:03,539 INFO L93 Difference]: Finished difference Result 48 states and 77 transitions. [2023-10-12 17:12:03,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 77 transitions. [2023-10-12 17:12:03,541 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:12:03,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 33 states and 54 transitions. [2023-10-12 17:12:03,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2023-10-12 17:12:03,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2023-10-12 17:12:03,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 54 transitions. [2023-10-12 17:12:03,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:12:03,547 INFO L219 hiAutomatonCegarLoop]: Abstraction has 33 states and 54 transitions. [2023-10-12 17:12:03,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 54 transitions. [2023-10-12 17:12:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-10-12 17:12:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 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:12:03,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 54 transitions. [2023-10-12 17:12:03,557 INFO L241 hiAutomatonCegarLoop]: Abstraction has 33 states and 54 transitions. [2023-10-12 17:12:03,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:12:03,558 INFO L430 stractBuchiCegarLoop]: Abstraction has 33 states and 54 transitions. [2023-10-12 17:12:03,566 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:12:03,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 54 transitions. [2023-10-12 17:12:03,568 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:12:03,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:03,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:03,569 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:03,569 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:03,569 INFO L748 eck$LassoCheckResult]: Stem: 646#[$Ultimate##0]don't care [78] $Ultimate##0-->L22-1: Formula: (= 1 v_ULTIMATE.start_x_1) InVars {} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_1} AuxVars[] AssignedVars[ULTIMATE.start_x] 582#[L22-1]don't care [65] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[] 584#[L23]don't care [95] L23-->$Ultimate##0: Formula: (and (= v_fooThread1of2ForFork1_i_2 v_ULTIMATE.start_x_37) (= v_ULTIMATE.start_x_37 v_fooThread1of2ForFork1_thidvar0_2)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_37} OutVars{fooThread1of2ForFork1_y=v_fooThread1of2ForFork1_y_4, fooThread1of2ForFork1_i=v_fooThread1of2ForFork1_i_2, ULTIMATE.start_x=v_ULTIMATE.start_x_37, fooThread1of2ForFork1_thidvar0=v_fooThread1of2ForFork1_thidvar0_2} AuxVars[] AssignedVars[fooThread1of2ForFork1_y, fooThread1of2ForFork1_i, fooThread1of2ForFork1_thidvar0] 626#[L23-1, $Ultimate##0]don't care [72] L23-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_x_4) v_ULTIMATE.start_x_3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_3} AuxVars[] AssignedVars[ULTIMATE.start_x] 620#[$Ultimate##0, L22-1]don't care [109] L22-1-->L27: Formula: (and (<= 2 v_ULTIMATE.start_x_50) (= v_ULTIMATE.start_x_49 1)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_50} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_49} AuxVars[] AssignedVars[ULTIMATE.start_x] 622#[L27, $Ultimate##0]don't care [111] $Ultimate##0-->fooEXIT: Formula: (= v_fooThread1of2ForFork1_y_5 4) InVars {} OutVars{fooThread1of2ForFork1_y=v_fooThread1of2ForFork1_y_5} AuxVars[] AssignedVars[fooThread1of2ForFork1_y] 628#[L27, fooEXIT]don't care [99] fooEXIT-->L28: Formula: (= v_ULTIMATE.start_x_46 v_fooThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_46, fooThread1of2ForFork1_thidvar0=v_fooThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_46, fooThread1of2ForFork1_thidvar0=v_fooThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[] 644#[L28]don't care [77] L28-->L29: Formula: (< v_ULTIMATE.start_x_7 3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_7} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_7} AuxVars[] AssignedVars[] 634#[L29]don't care [91] L29-->$Ultimate##0: Formula: (and (= v_fooThread1of2ForFork0_i_2 v_ULTIMATE.start_x_31) (= v_ULTIMATE.start_x_31 v_fooThread1of2ForFork0_thidvar0_2)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_31} OutVars{fooThread1of2ForFork0_y=v_fooThread1of2ForFork0_y_4, fooThread1of2ForFork0_i=v_fooThread1of2ForFork0_i_2, ULTIMATE.start_x=v_ULTIMATE.start_x_31, fooThread1of2ForFork0_thidvar0=v_fooThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread1of2ForFork0_y, fooThread1of2ForFork0_i, fooThread1of2ForFork0_thidvar0] 636#[$Ultimate##0, L29-1]don't care [69] L29-1-->L28: Formula: (= (+ 1 v_ULTIMATE.start_x_9) v_ULTIMATE.start_x_8) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_9} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_8} AuxVars[] AssignedVars[ULTIMATE.start_x] 638#[L28, $Ultimate##0]don't care [77] L28-->L29: Formula: (< v_ULTIMATE.start_x_7 3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_7} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_7} AuxVars[] AssignedVars[] 642#[$Ultimate##0, L29]don't care [92] L29-->$Ultimate##0: Formula: (and (= v_fooThread2of2ForFork0_thidvar0_2 v_ULTIMATE.start_x_34) (= v_fooThread2of2ForFork0_i_2 v_ULTIMATE.start_x_34)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_34} OutVars{fooThread2of2ForFork0_thidvar0=v_fooThread2of2ForFork0_thidvar0_2, ULTIMATE.start_x=v_ULTIMATE.start_x_34, fooThread2of2ForFork0_y=v_fooThread2of2ForFork0_y_4, fooThread2of2ForFork0_i=v_fooThread2of2ForFork0_i_2} AuxVars[] AssignedVars[fooThread2of2ForFork0_thidvar0, fooThread2of2ForFork0_y, fooThread2of2ForFork0_i] 610#[$Ultimate##0, $Ultimate##0, L29-1]don't care [69] L29-1-->L28: Formula: (= (+ 1 v_ULTIMATE.start_x_9) v_ULTIMATE.start_x_8) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_9} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_8} AuxVars[] AssignedVars[ULTIMATE.start_x] 612#[$Ultimate##0, L28, $Ultimate##0]don't care [77] L28-->L29: Formula: (< v_ULTIMATE.start_x_7 3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_7} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_7} AuxVars[] AssignedVars[] 592#[$Ultimate##0, $Ultimate##0, L29]don't care [89] L29-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 596#[$Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2023-10-12 17:12:03,569 INFO L750 eck$LassoCheckResult]: Loop: 596#[$Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [90] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 596#[$Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2023-10-12 17:12:03,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1991857231, now seen corresponding path program 1 times [2023-10-12 17:12:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:03,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139658981] [2023-10-12 17:12:03,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:03,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:03,675 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:12:03,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:03,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139658981] [2023-10-12 17:12:03,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139658981] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:03,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:03,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-10-12 17:12:03,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760065956] [2023-10-12 17:12:03,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:03,676 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:12:03,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:03,677 INFO L85 PathProgramCache]: Analyzing trace with hash 121, now seen corresponding path program 1 times [2023-10-12 17:12:03,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:03,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083150567] [2023-10-12 17:12:03,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:03,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:03,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:03,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:03,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:03,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:12:03,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:12:03,699 INFO L87 Difference]: Start difference. First operand 33 states and 54 transitions. cyclomatic complexity: 25 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:12:03,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:03,737 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2023-10-12 17:12:03,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2023-10-12 17:12:03,738 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:12:03,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2023-10-12 17:12:03,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:12:03,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:12:03,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:12:03,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:12:03,739 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:03,739 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:03,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:12:03,743 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:03,743 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:12:03,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:12:03,743 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:12:03,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:12:03,747 INFO L201 PluginConnector]: Adding new model fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:12:03 BoogieIcfgContainer [2023-10-12 17:12:03,747 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:12:03,748 INFO L158 Benchmark]: Toolchain (without parser) took 1378.12ms. Allocated memory was 196.1MB in the beginning and 339.7MB in the end (delta: 143.7MB). Free memory was 145.0MB in the beginning and 254.0MB in the end (delta: -109.1MB). Peak memory consumption was 36.6MB. Max. memory is 8.0GB. [2023-10-12 17:12:03,748 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 196.1MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:12:03,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.23ms. Allocated memory is still 196.1MB. Free memory was 145.0MB in the beginning and 143.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:03,749 INFO L158 Benchmark]: Boogie Preprocessor took 13.52ms. Allocated memory is still 196.1MB. Free memory was 143.5MB in the beginning and 142.4MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:03,749 INFO L158 Benchmark]: RCFGBuilder took 158.03ms. Allocated memory is still 196.1MB. Free memory was 142.4MB in the beginning and 133.7MB in the end (delta: 8.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:12:03,749 INFO L158 Benchmark]: BuchiAutomizer took 1182.31ms. Allocated memory was 196.1MB in the beginning and 339.7MB in the end (delta: 143.7MB). Free memory was 133.6MB in the beginning and 254.0MB in the end (delta: -120.5MB). Peak memory consumption was 25.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:03,751 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22ms. Allocated memory is still 196.1MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.23ms. Allocated memory is still 196.1MB. Free memory was 145.0MB in the beginning and 143.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.52ms. Allocated memory is still 196.1MB. Free memory was 143.5MB in the beginning and 142.4MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 158.03ms. Allocated memory is still 196.1MB. Free memory was 142.4MB in the beginning and 133.7MB in the end (delta: 8.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1182.31ms. Allocated memory was 196.1MB in the beginning and 339.7MB in the end (delta: 143.7MB). Free memory was 133.6MB in the beginning and 254.0MB in the end (delta: -120.5MB). Peak memory consumption was 25.0MB. 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 (2 trivial, 0 deterministic, 0 nondeterministic). 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.6s and 5 iterations. TraceHistogramMax:3. Analysis of lassos took 0.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 103 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 8 mSDtfsCounter, 103 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN3 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s - 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.0s, 23 PlacesBefore, 20 PlacesAfterwards, 20 TransitionsBefore, 17 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 62 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 39, unknown conditional: 0, unknown unconditional: 39] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 31 PlacesAfterwards, 37 TransitionsBefore, 31 TransitionsAfterwards, 336 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 674 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 674, independent: 674, independent conditional: 0, independent unconditional: 674, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 258, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 258, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 674, independent: 416, independent conditional: 0, independent unconditional: 416, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 258, unknown conditional: 0, unknown unconditional: 258] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:12:03,811 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...