/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/TwoActiveWorkersSirius.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:11:57,602 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:11:57,689 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:11:57,730 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:11:57,730 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:11:57,731 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:11:57,732 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:11:57,732 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:11:57,732 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:11:57,735 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:11:57,735 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:11:57,735 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:11:57,735 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:11:57,736 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:11:57,737 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:11:57,737 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:11:57,737 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:11:57,737 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:11:57,737 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:11:57,737 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:11:57,737 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:11:57,753 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:11:57,753 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:11:57,753 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:11:57,753 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:11:57,754 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:11:57,754 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:11:57,754 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:11:57,754 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:11:57,754 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:11:57,754 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:11:57,755 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:11:57,755 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:11:57,756 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:11:57,756 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:11:58,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:11:58,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:11:58,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:11:58,144 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:11:58,144 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:11:58,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/TwoActiveWorkersSirius.bpl [2023-10-12 17:11:58,145 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/TwoActiveWorkersSirius.bpl' [2023-10-12 17:11:58,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:11:58,166 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:11:58,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:11:58,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:11:58,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:11:58,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,183 INFO L138 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:11:58,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:11:58,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:11:58,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:11:58,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:11:58,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:11:58,199 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:11:58,199 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:11:58,199 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:11:58,200 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:11:58,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:11:58,265 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:11:58,271 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:11:58,293 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:11:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:11:58,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:11:58,296 INFO L124 BoogieDeclarations]: Specification and implementation of procedure worker given in one single declaration [2023-10-12 17:11:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2023-10-12 17:11:58,297 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2023-10-12 17:11:58,297 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:11:58,328 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:11:58,329 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:11:58,387 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:11:58,391 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:11:58,391 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-10-12 17:11:58,392 INFO L201 PluginConnector]: Adding new model TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:11:58 BoogieIcfgContainer [2023-10-12 17:11:58,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:11:58,393 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:11:58,393 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:11:58,395 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:11:58,396 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:11:58,396 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/2) ... [2023-10-12 17:11:58,397 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c16f07d and model type TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:11:58, skipping insertion in model container [2023-10-12 17:11:58,397 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:11:58,397 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:11:58" (2/2) ... [2023-10-12 17:11:58,398 INFO L332 chiAutomizerObserver]: Analyzing ICFG TwoActiveWorkersSirius.bpl [2023-10-12 17:11:58,428 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-10-12 17:11:58,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 16 transitions, 40 flow [2023-10-12 17:11:58,460 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2023-10-12 17:11:58,460 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-10-12 17:11:58,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 19 events. 2/19 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 8. Up to 3 conditions per place. [2023-10-12 17:11:58,463 INFO L82 GeneralOperation]: Start removeDead. Operand has 17 places, 16 transitions, 40 flow [2023-10-12 17:11:58,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 17 places, 16 transitions, 40 flow [2023-10-12 17:11:58,468 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:11:58,477 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 16 transitions, 40 flow [2023-10-12 17:11:58,479 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 17 places, 16 transitions, 40 flow [2023-10-12 17:11:58,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 16 transitions, 40 flow [2023-10-12 17:11:58,483 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2023-10-12 17:11:58,483 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-10-12 17:11:58,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 19 events. 2/19 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 8. Up to 3 conditions per place. [2023-10-12 17:11:58,484 INFO L119 LiptonReduction]: Number of co-enabled transitions 70 [2023-10-12 17:11:58,600 INFO L134 LiptonReduction]: Checked pairs total: 122 [2023-10-12 17:11:58,600 INFO L136 LiptonReduction]: Total number of compositions: 6 [2023-10-12 17:11:58,613 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:11:58,613 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:11:58,613 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:11:58,613 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:11:58,614 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:11:58,614 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:11:58,614 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:11:58,614 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:11:58,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:11:58,633 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2023-10-12 17:11:58,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:58,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:58,637 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2023-10-12 17:11:58,637 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:11:58,637 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:11:58,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 23 states, but on-demand construction may add more states [2023-10-12 17:11:58,639 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2023-10-12 17:11:58,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:58,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:58,639 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2023-10-12 17:11:58,639 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:11:58,642 INFO L748 eck$LassoCheckResult]: Stem: 20#[$Ultimate##0]don't care [48] $Ultimate##0-->L19-1: Formula: (and (= v_c_24 0) (= v_i_30 0)) InVars {} OutVars{i=v_i_30, c=v_c_24} AuxVars[] AssignedVars[i, c] 23#[L19-1]don't care [2023-10-12 17:11:58,642 INFO L750 eck$LassoCheckResult]: Loop: 23#[L19-1]don't care [43] L19-1-->$Ultimate##0: Formula: (= v_i_11 v_workerThread1of1ForFork0_thidvar0_2) InVars {i=v_i_11} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, i=v_i_11} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0] 25#[$Ultimate##0, L20]don't care [36] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c] 33#[L20, L30]don't care [33] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[] 37#[L21, L30]don't care [50] L30-->workerEXIT: Formula: (and (= v_c_35 (+ v_c_34 v_i_44)) (<= v_c_35 (* v_i_44 2))) InVars {i=v_i_44, c=v_c_35} OutVars{i=v_i_44, c=v_c_34} AuxVars[] AssignedVars[c] 51#[L21, workerEXIT]don't care [44] workerEXIT-->L21-2: Formula: (= v_i_13 (+ v_workerThread1of1ForFork0_thidvar0_4 1)) InVars {workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_4, i=v_i_13} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_4, i=v_i_13} AuxVars[] AssignedVars[] 63#[L21-2]don't care [32] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 23#[L19-1]don't care [2023-10-12 17:11:58,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:58,646 INFO L85 PathProgramCache]: Analyzing trace with hash 79, now seen corresponding path program 1 times [2023-10-12 17:11:58,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:58,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934118046] [2023-10-12 17:11:58,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:58,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:58,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:58,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:58,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:58,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2142130817, now seen corresponding path program 1 times [2023-10-12 17:11:58,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:58,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699469210] [2023-10-12 17:11:58,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:58,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:11:58,932 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:11:58,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:11:58,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699469210] [2023-10-12 17:11:58,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699469210] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:11:58,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:11:58,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:11:58,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984129747] [2023-10-12 17:11:58,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:11:58,938 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:11:58,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:11:58,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:11:58,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:11:58,987 INFO L87 Difference]: Start difference. First operand currently 23 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:11:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:11:59,028 INFO L93 Difference]: Finished difference Result 18 states and 30 transitions. [2023-10-12 17:11:59,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 30 transitions. [2023-10-12 17:11:59,030 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:11:59,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 23 transitions. [2023-10-12 17:11:59,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-10-12 17:11:59,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-10-12 17:11:59,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2023-10-12 17:11:59,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:11:59,033 INFO L219 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-10-12 17:11:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2023-10-12 17:11:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-10-12 17:11:59,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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:11:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2023-10-12 17:11:59,066 INFO L241 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-10-12 17:11:59,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:11:59,086 INFO L430 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2023-10-12 17:11:59,086 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:11:59,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2023-10-12 17:11:59,087 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:11:59,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:59,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:59,087 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:11:59,087 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:59,088 INFO L748 eck$LassoCheckResult]: Stem: 119#[$Ultimate##0]don't care [48] $Ultimate##0-->L19-1: Formula: (and (= v_c_24 0) (= v_i_30 0)) InVars {} OutVars{i=v_i_30, c=v_c_24} AuxVars[] AssignedVars[i, c] 93#[L19-1]don't care [43] L19-1-->$Ultimate##0: Formula: (= v_i_11 v_workerThread1of1ForFork0_thidvar0_2) InVars {i=v_i_11} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, i=v_i_11} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0] 95#[$Ultimate##0, L20]don't care [49] L20-->L19-1: Formula: (and (<= v_i_33 0) (= (+ v_i_33 1) v_i_32)) InVars {i=v_i_33} OutVars{i=v_i_32} AuxVars[] AssignedVars[i] 109#[$Ultimate##0, L19-1]don't care [41] L19-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 111#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2023-10-12 17:11:59,088 INFO L750 eck$LassoCheckResult]: Loop: 111#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [42] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 111#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2023-10-12 17:11:59,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2396372, now seen corresponding path program 1 times [2023-10-12 17:11:59,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115769189] [2023-10-12 17:11:59,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,126 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 1 times [2023-10-12 17:11:59,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996029571] [2023-10-12 17:11:59,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,151 INFO L85 PathProgramCache]: Analyzing trace with hash 74287574, now seen corresponding path program 1 times [2023-10-12 17:11:59,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060781388] [2023-10-12 17:11:59,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,266 WARN L148 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-10-12 17:11:59,279 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:11:59,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 23 transitions, 64 flow [2023-10-12 17:11:59,291 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2023-10-12 17:11:59,291 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2023-10-12 17:11:59,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 36 events. 4/36 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 25. Up to 5 conditions per place. [2023-10-12 17:11:59,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 23 transitions, 64 flow [2023-10-12 17:11:59,309 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 23 transitions, 64 flow [2023-10-12 17:11:59,309 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:11:59,309 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 23 transitions, 64 flow [2023-10-12 17:11:59,310 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 23 transitions, 64 flow [2023-10-12 17:11:59,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 23 transitions, 64 flow [2023-10-12 17:11:59,322 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2023-10-12 17:11:59,322 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2023-10-12 17:11:59,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 36 events. 4/36 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 25. Up to 5 conditions per place. [2023-10-12 17:11:59,324 INFO L119 LiptonReduction]: Number of co-enabled transitions 230 [2023-10-12 17:11:59,413 INFO L134 LiptonReduction]: Checked pairs total: 468 [2023-10-12 17:11:59,414 INFO L136 LiptonReduction]: Total number of compositions: 5 [2023-10-12 17:11:59,415 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:11:59,415 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:11:59,415 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:11:59,415 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:11:59,415 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:11:59,415 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:11:59,415 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:11:59,415 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:11:59,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:11:59,441 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 103 [2023-10-12 17:11:59,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:59,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:59,441 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2023-10-12 17:11:59,442 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:11:59,442 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:11:59,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 168 states, but on-demand construction may add more states [2023-10-12 17:11:59,449 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 103 [2023-10-12 17:11:59,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:59,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:59,449 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2023-10-12 17:11:59,449 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:11:59,449 INFO L748 eck$LassoCheckResult]: Stem: 28#[$Ultimate##0]don't care [84] $Ultimate##0-->L19-1: Formula: (and (= v_i_84 0) (= v_c_93 0)) InVars {} OutVars{i=v_i_84, c=v_c_93} AuxVars[] AssignedVars[i, c] 31#[L19-1]don't care [2023-10-12 17:11:59,450 INFO L750 eck$LassoCheckResult]: Loop: 31#[L19-1]don't care [77] L19-1-->$Ultimate##0: Formula: (= v_i_57 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_57} OutVars{i=v_i_57, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0] 35#[L20, $Ultimate##0]don't care [70] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c] 39#[L20, L30]don't care [72] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[] 51#[L20, L31]don't care [62] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[] 73#[L21, L31]don't care [83] L31-->workerEXIT: Formula: (= (+ v_c_89 v_i_82) v_c_90) InVars {i=v_i_82, c=v_c_90} OutVars{i=v_i_82, c=v_c_89} AuxVars[] AssignedVars[c] 103#[workerEXIT, L21]don't care [79] workerEXIT-->L21-2: Formula: (= (+ v_workerThread1of2ForFork0_thidvar0_4 1) v_i_61) InVars {i=v_i_61, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} OutVars{i=v_i_61, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[] 147#[L21-2]don't care [61] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 31#[L19-1]don't care [2023-10-12 17:11:59,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,450 INFO L85 PathProgramCache]: Analyzing trace with hash 115, now seen corresponding path program 1 times [2023-10-12 17:11:59,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402531540] [2023-10-12 17:11:59,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,454 INFO L85 PathProgramCache]: Analyzing trace with hash -861386863, now seen corresponding path program 1 times [2023-10-12 17:11:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53990019] [2023-10-12 17:11:59,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:11:59,476 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:11:59,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:11:59,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53990019] [2023-10-12 17:11:59,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53990019] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:11:59,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:11:59,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:11:59,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423491973] [2023-10-12 17:11:59,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:11:59,478 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:11:59,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:11:59,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:11:59,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:11:59,478 INFO L87 Difference]: Start difference. First operand currently 168 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:11:59,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:11:59,508 INFO L93 Difference]: Finished difference Result 187 states and 470 transitions. [2023-10-12 17:11:59,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 470 transitions. [2023-10-12 17:11:59,512 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 119 [2023-10-12 17:11:59,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 176 states and 444 transitions. [2023-10-12 17:11:59,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 176 [2023-10-12 17:11:59,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 176 [2023-10-12 17:11:59,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 176 states and 444 transitions. [2023-10-12 17:11:59,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:11:59,517 INFO L219 hiAutomatonCegarLoop]: Abstraction has 176 states and 444 transitions. [2023-10-12 17:11:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states and 444 transitions. [2023-10-12 17:11:59,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 162. [2023-10-12 17:11:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 162 states have (on average 2.580246913580247) internal successors, (418), 161 states have internal predecessors, (418), 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:11:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 418 transitions. [2023-10-12 17:11:59,527 INFO L241 hiAutomatonCegarLoop]: Abstraction has 162 states and 418 transitions. [2023-10-12 17:11:59,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:11:59,528 INFO L430 stractBuchiCegarLoop]: Abstraction has 162 states and 418 transitions. [2023-10-12 17:11:59,528 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:11:59,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 418 transitions. [2023-10-12 17:11:59,530 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 115 [2023-10-12 17:11:59,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:59,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:59,530 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:11:59,530 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:11:59,530 INFO L748 eck$LassoCheckResult]: Stem: 688#[$Ultimate##0]don't care [84] $Ultimate##0-->L19-1: Formula: (and (= v_i_84 0) (= v_c_93 0)) InVars {} OutVars{i=v_i_84, c=v_c_93} AuxVars[] AssignedVars[i, c] 690#[L19-1]don't care [77] L19-1-->$Ultimate##0: Formula: (= v_i_57 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_57} OutVars{i=v_i_57, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0] 798#[L20, $Ultimate##0]don't care [85] L20-->L19-1: Formula: (and (= v_i_86 (+ v_i_87 1)) (<= v_i_87 0)) InVars {i=v_i_87} OutVars{i=v_i_86} AuxVars[] AssignedVars[i] 800#[L19-1, $Ultimate##0]don't care [2023-10-12 17:11:59,531 INFO L750 eck$LassoCheckResult]: Loop: 800#[L19-1, $Ultimate##0]don't care [78] L19-1-->$Ultimate##0: Formula: (= v_i_59 v_workerThread2of2ForFork0_thidvar0_2) InVars {i=v_i_59} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_2, i=v_i_59} AuxVars[] AssignedVars[workerThread2of2ForFork0_thidvar0] 822#[L20, $Ultimate##0, $Ultimate##0]don't care [62] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[] 866#[$Ultimate##0, $Ultimate##0, L21]don't care [65] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c] 644#[L30, $Ultimate##0, L21]don't care [67] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[] 648#[$Ultimate##0, L21, L31]don't care [81] L31-->workerEXIT: Formula: (= v_c_76 (+ v_c_75 v_i_76)) InVars {i=v_i_76, c=v_c_76} OutVars{i=v_i_76, c=v_c_75} AuxVars[] AssignedVars[c] 880#[workerEXIT, $Ultimate##0, L21]don't care [80] workerEXIT-->L21-2: Formula: (= v_i_63 (+ v_workerThread2of2ForFork0_thidvar0_4 1)) InVars {workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_63} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_63} AuxVars[] AssignedVars[] 562#[L21-2, $Ultimate##0]don't care [61] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 800#[L19-1, $Ultimate##0]don't care [2023-10-12 17:11:59,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,531 INFO L85 PathProgramCache]: Analyzing trace with hash 112987, now seen corresponding path program 1 times [2023-10-12 17:11:59,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550283902] [2023-10-12 17:11:59,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,536 INFO L85 PathProgramCache]: Analyzing trace with hash -209233973, now seen corresponding path program 1 times [2023-10-12 17:11:59,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277226366] [2023-10-12 17:11:59,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:11:59,553 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:11:59,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:11:59,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277226366] [2023-10-12 17:11:59,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277226366] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:11:59,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:11:59,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:11:59,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769199261] [2023-10-12 17:11:59,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:11:59,554 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:11:59,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:11:59,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:11:59,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:11:59,555 INFO L87 Difference]: Start difference. First operand 162 states and 418 transitions. cyclomatic complexity: 283 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:11:59,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:11:59,579 INFO L93 Difference]: Finished difference Result 171 states and 430 transitions. [2023-10-12 17:11:59,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 430 transitions. [2023-10-12 17:11:59,581 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 105 [2023-10-12 17:11:59,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 167 states and 419 transitions. [2023-10-12 17:11:59,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2023-10-12 17:11:59,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2023-10-12 17:11:59,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 419 transitions. [2023-10-12 17:11:59,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:11:59,584 INFO L219 hiAutomatonCegarLoop]: Abstraction has 167 states and 419 transitions. [2023-10-12 17:11:59,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 419 transitions. [2023-10-12 17:11:59,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2023-10-12 17:11:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 166 states have (on average 2.5180722891566263) internal successors, (418), 165 states have internal predecessors, (418), 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:11:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 418 transitions. [2023-10-12 17:11:59,592 INFO L241 hiAutomatonCegarLoop]: Abstraction has 166 states and 418 transitions. [2023-10-12 17:11:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:11:59,593 INFO L430 stractBuchiCegarLoop]: Abstraction has 166 states and 418 transitions. [2023-10-12 17:11:59,593 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:11:59,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 418 transitions. [2023-10-12 17:11:59,594 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 105 [2023-10-12 17:11:59,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:59,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:59,594 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:11:59,594 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:11:59,595 INFO L748 eck$LassoCheckResult]: Stem: 1181#[$Ultimate##0]don't care [84] $Ultimate##0-->L19-1: Formula: (and (= v_i_84 0) (= v_c_93 0)) InVars {} OutVars{i=v_i_84, c=v_c_93} AuxVars[] AssignedVars[i, c] 1183#[L19-1]don't care [77] L19-1-->$Ultimate##0: Formula: (= v_i_57 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_57} OutVars{i=v_i_57, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0] 1303#[L20, $Ultimate##0]don't care [85] L20-->L19-1: Formula: (and (= v_i_86 (+ v_i_87 1)) (<= v_i_87 0)) InVars {i=v_i_87} OutVars{i=v_i_86} AuxVars[] AssignedVars[i] 1305#[L19-1, $Ultimate##0]don't care [2023-10-12 17:11:59,595 INFO L750 eck$LassoCheckResult]: Loop: 1305#[L19-1, $Ultimate##0]don't care [78] L19-1-->$Ultimate##0: Formula: (= v_i_59 v_workerThread2of2ForFork0_thidvar0_2) InVars {i=v_i_59} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_2, i=v_i_59} AuxVars[] AssignedVars[workerThread2of2ForFork0_thidvar0] 1209#[L20, $Ultimate##0, $Ultimate##0]don't care [65] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c] 1211#[L20, L30, $Ultimate##0]don't care [67] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[] 1291#[L20, $Ultimate##0, L31]don't care [62] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[] 1099#[$Ultimate##0, L21, L31]don't care [70] $Ultimate##0-->L30: Formula: (= (+ v_i_6 v_c_3) v_c_2) InVars {i=v_i_6, c=v_c_3} OutVars{i=v_i_6, c=v_c_2} AuxVars[] AssignedVars[c] 1101#[L30, L21, L31]don't care [72] L30-->L31: Formula: (<= v_c_5 (* 2 v_i_8)) InVars {i=v_i_8, c=v_c_5} OutVars{i=v_i_8, c=v_c_5} AuxVars[] AssignedVars[] 1119#[L31, L21, L31]don't care [81] L31-->workerEXIT: Formula: (= v_c_76 (+ v_c_75 v_i_76)) InVars {i=v_i_76, c=v_c_76} OutVars{i=v_i_76, c=v_c_75} AuxVars[] AssignedVars[c] 1083#[L31, workerEXIT, L21]don't care [83] L31-->workerEXIT: Formula: (= (+ v_c_89 v_i_82) v_c_90) InVars {i=v_i_82, c=v_c_90} OutVars{i=v_i_82, c=v_c_89} AuxVars[] AssignedVars[c] 1163#[workerEXIT, L21, workerEXIT]don't care [79] workerEXIT-->L21-2: Formula: (= (+ v_workerThread1of2ForFork0_thidvar0_4 1) v_i_61) InVars {i=v_i_61, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} OutVars{i=v_i_61, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[] 1239#[workerEXIT, L21-2]don't care [61] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 1257#[L19-1, workerEXIT]don't care [77] L19-1-->$Ultimate##0: Formula: (= v_i_57 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_57} OutVars{i=v_i_57, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0] 1259#[L20, workerEXIT, $Ultimate##0]don't care [62] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[] 1367#[workerEXIT, $Ultimate##0, L21]don't care [80] workerEXIT-->L21-2: Formula: (= v_i_63 (+ v_workerThread2of2ForFork0_thidvar0_4 1)) InVars {workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_63} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_63} AuxVars[] AssignedVars[] 1337#[L21-2, $Ultimate##0]don't care [61] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 1305#[L19-1, $Ultimate##0]don't care [2023-10-12 17:11:59,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash 112987, now seen corresponding path program 2 times [2023-10-12 17:11:59,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998234066] [2023-10-12 17:11:59,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,600 INFO L85 PathProgramCache]: Analyzing trace with hash -602142849, now seen corresponding path program 1 times [2023-10-12 17:11:59,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203053271] [2023-10-12 17:11:59,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,611 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: No thread ID for procedure workerThread1of2ForFork0 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.createThreadIds(IcfgProgramExecution.java:218) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:115) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.computeIcfgProgramExecution(IcfgProgramExecutionBuilder.java:169) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.getIcfgProgramExecution(IcfgProgramExecutionBuilder.java:75) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:435) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:385) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:361) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:881) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopFeasibility(LassoCheck.java:843) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:763) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:361) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:341) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-10-12 17:11:59,613 INFO L158 Benchmark]: Toolchain (without parser) took 1447.38ms. Allocated memory was 224.4MB in the beginning and 270.5MB in the end (delta: 46.1MB). Free memory was 175.4MB in the beginning and 186.0MB in the end (delta: -10.6MB). Peak memory consumption was 35.3MB. Max. memory is 8.0GB. [2023-10-12 17:11:59,613 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 224.4MB. Free memory is still 176.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:11:59,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.73ms. Allocated memory is still 224.4MB. Free memory was 175.3MB in the beginning and 173.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:11:59,614 INFO L158 Benchmark]: Boogie Preprocessor took 11.95ms. Allocated memory is still 224.4MB. Free memory was 173.8MB in the beginning and 172.8MB in the end (delta: 952.4kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:11:59,615 INFO L158 Benchmark]: RCFGBuilder took 193.65ms. Allocated memory is still 224.4MB. Free memory was 172.7MB in the beginning and 188.5MB in the end (delta: -15.8MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. [2023-10-12 17:11:59,615 INFO L158 Benchmark]: BuchiAutomizer took 1219.66ms. Allocated memory was 224.4MB in the beginning and 270.5MB in the end (delta: 46.1MB). Free memory was 188.4MB in the beginning and 186.0MB in the end (delta: 2.4MB). Peak memory consumption was 47.6MB. Max. memory is 8.0GB. [2023-10-12 17:11:59,616 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 224.4MB. Free memory is still 176.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.73ms. Allocated memory is still 224.4MB. Free memory was 175.3MB in the beginning and 173.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.95ms. Allocated memory is still 224.4MB. Free memory was 173.8MB in the beginning and 172.8MB in the end (delta: 952.4kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 193.65ms. Allocated memory is still 224.4MB. Free memory was 172.7MB in the beginning and 188.5MB in the end (delta: -15.8MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 1219.66ms. Allocated memory was 224.4MB in the beginning and 270.5MB in the end (delta: 46.1MB). Free memory was 188.4MB in the beginning and 186.0MB in the end (delta: 2.4MB). Peak memory consumption was 47.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 17 PlacesBefore, 13 PlacesAfterwards, 16 TransitionsBefore, 12 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 122 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 86, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 49, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 49, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 49, unknown conditional: 0, unknown unconditional: 49] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 25 PlacesBefore, 21 PlacesAfterwards, 23 TransitionsBefore, 19 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 468 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 208, independent: 184, independent conditional: 0, independent unconditional: 184, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 124, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 124, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 208, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 124, unknown conditional: 0, unknown unconditional: 124] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: AssertionError: No thread ID for procedure workerThread1of2ForFork0 de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: No thread ID for procedure workerThread1of2ForFork0: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.createThreadIds(IcfgProgramExecution.java:218) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-10-12 17:11:59,633 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...