/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/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/concurrent/bpl/TwoActiveWorkersSirius.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.fs.omega-petrinet-ed1a3e5-m [2022-09-29 14:47:44,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 14:47:44,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 14:47:44,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 14:47:44,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 14:47:44,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 14:47:44,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 14:47:44,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 14:47:44,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 14:47:44,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 14:47:44,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 14:47:44,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 14:47:44,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 14:47:44,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 14:47:44,258 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 14:47:44,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 14:47:44,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 14:47:44,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 14:47:44,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 14:47:44,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 14:47:44,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 14:47:44,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 14:47:44,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 14:47:44,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 14:47:44,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 14:47:44,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 14:47:44,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 14:47:44,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 14:47:44,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 14:47:44,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 14:47:44,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 14:47:44,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 14:47:44,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 14:47:44,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 14:47:44,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 14:47:44,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 14:47:44,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 14:47:44,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 14:47:44,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 14:47:44,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 14:47:44,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 14:47:44,299 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-09-29 14:47:44,331 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 14:47:44,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 14:47:44,332 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 14:47:44,332 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 14:47:44,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 14:47:44,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 14:47:44,334 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 14:47:44,334 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-09-29 14:47:44,334 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-09-29 14:47:44,334 INFO L138 SettingsManager]: * Use old map elimination=false [2022-09-29 14:47:44,335 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-09-29 14:47:44,335 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-09-29 14:47:44,335 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-09-29 14:47:44,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 14:47:44,335 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 14:47:44,335 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-09-29 14:47:44,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 14:47:44,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 14:47:44,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 14:47:44,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-09-29 14:47:44,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-09-29 14:47:44,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-09-29 14:47:44,336 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 14:47:44,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 14:47:44,336 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-09-29 14:47:44,336 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 14:47:44,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-09-29 14:47:44,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 14:47:44,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 14:47:44,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 14:47:44,337 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 14:47:44,339 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-09-29 14:47:44,339 INFO L138 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 [2022-09-29 14:47:44,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 14:47:44,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 14:47:44,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 14:47:44,558 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 14:47:44,559 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 14:47:44,560 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/TwoActiveWorkersSirius.bpl [2022-09-29 14:47:44,560 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/TwoActiveWorkersSirius.bpl' [2022-09-29 14:47:44,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 14:47:44,576 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-09-29 14:47:44,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-29 14:47:44,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-29 14:47:44,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-29 14:47:44,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,598 INFO L137 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-09-29 14:47:44,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-29 14:47:44,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 14:47:44,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 14:47:44,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 14:47:44,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 14:47:44,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 14:47:44,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 14:47:44,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 14:47:44,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 14:47:44,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 14:47:44,653 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) [2022-09-29 14:47:44,665 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 [2022-09-29 14:47:44,691 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-09-29 14:47:44,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 14:47:44,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 14:47:44,692 INFO L124 BoogieDeclarations]: Specification and implementation of procedure worker given in one single declaration [2022-09-29 14:47:44,692 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2022-09-29 14:47:44,692 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2022-09-29 14:47:44,693 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-29 14:47:44,733 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 14:47:44,735 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 14:47:44,820 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 14:47:44,826 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 14:47:44,827 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-09-29 14:47:44,829 INFO L202 PluginConnector]: Adding new model TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 02:47:44 BoogieIcfgContainer [2022-09-29 14:47:44,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 14:47:44,831 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-09-29 14:47:44,831 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-09-29 14:47:44,834 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-09-29 14:47:44,835 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 14:47:44,835 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/2) ... [2022-09-29 14:47:44,838 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3255f09d and model type TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.09 02:47:44, skipping insertion in model container [2022-09-29 14:47:44,838 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 14:47:44,838 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 02:47:44" (2/2) ... [2022-09-29 14:47:44,846 INFO L322 chiAutomizerObserver]: Analyzing ICFG TwoActiveWorkersSirius.bpl [2022-09-29 14:47:44,915 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-09-29 14:47:44,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 16 places, 15 transitions, 38 flow [2022-09-29 14:47:44,962 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:44,962 INFO L123 PetriNetUnfolderBase]: 2/17 cut-off events. [2022-09-29 14:47:44,962 INFO L124 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2022-09-29 14:47:44,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 17 events. 2/17 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 17 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 7. Up to 3 conditions per place. [2022-09-29 14:47:44,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 16 places, 15 transitions, 38 flow [2022-09-29 14:47:44,971 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 16 places, 15 transitions, 38 flow [2022-09-29 14:47:44,974 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 14:47:44,994 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 16 places, 15 transitions, 38 flow [2022-09-29 14:47:44,997 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 16 places, 15 transitions, 38 flow [2022-09-29 14:47:44,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 16 places, 15 transitions, 38 flow [2022-09-29 14:47:45,001 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:45,001 INFO L123 PetriNetUnfolderBase]: 2/17 cut-off events. [2022-09-29 14:47:45,002 INFO L124 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2022-09-29 14:47:45,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 17 events. 2/17 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 7. Up to 3 conditions per place. [2022-09-29 14:47:45,002 INFO L116 LiptonReduction]: Number of co-enabled transitions 60 [2022-09-29 14:47:45,217 INFO L131 LiptonReduction]: Checked pairs total: 107 [2022-09-29 14:47:45,217 INFO L133 LiptonReduction]: Total number of compositions: 5 [2022-09-29 14:47:45,238 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 14:47:45,238 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 14:47:45,238 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 14:47:45,238 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 14:47:45,239 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 14:47:45,239 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 14:47:45,239 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 14:47:45,239 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-09-29 14:47:45,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-09-29 14:47:45,264 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2022-09-29 14:47:45,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:47:45,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:47:45,268 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-09-29 14:47:45,269 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-09-29 14:47:45,269 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 14:47:45,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 23 states, but on-demand construction may add more states [2022-09-29 14:47:45,271 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2022-09-29 14:47:45,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:47:45,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:47:45,271 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-09-29 14:47:45,272 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-09-29 14:47:45,275 INFO L733 eck$LassoCheckResult]: Stem: 19#[ULTIMATE.startENTRY]don't care [44] ULTIMATE.startENTRY-->L19-1: Formula: (and (= v_i_20 0) (= v_ctr_14 0)) InVars {} OutVars{i=v_i_20, ctr=v_ctr_14} AuxVars[] AssignedVars[i, ctr] 22#[L19-1]don't care [2022-09-29 14:47:45,276 INFO L735 eck$LassoCheckResult]: Loop: 22#[L19-1]don't care [41] L19-1-->workerENTRY: 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] 26#[workerENTRY, L20]don't care [34] workerENTRY-->L30: Formula: (= (+ v_i_6 v_ctr_3) v_ctr_2) InVars {i=v_i_6, ctr=v_ctr_3} OutVars{i=v_i_6, ctr=v_ctr_2} AuxVars[] AssignedVars[ctr] 30#[L30, L20]don't care [47] L30-->workerEXIT: Formula: (and (<= v_ctr_35 (* v_i_44 2)) (= (+ (* (- 1) v_i_44) v_ctr_35) v_ctr_34)) InVars {i=v_i_44, ctr=v_ctr_35} OutVars{i=v_i_44, ctr=v_ctr_34} AuxVars[] AssignedVars[ctr] 42#[workerEXIT, L20]don't care [32] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[] 50#[workerEXIT, L21]don't care [42] workerEXIT-->L21-2: Formula: (= (+ (- 1) v_i_13) v_workerThread1of1ForFork0_thidvar0_4) InVars {workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_4, i=v_i_13} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_4, i=v_i_13} AuxVars[] AssignedVars[] 62#[L21-2]don't care [30] 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] 22#[L19-1]don't care [2022-09-29 14:47:45,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,280 INFO L85 PathProgramCache]: Analyzing trace with hash 75, now seen corresponding path program 1 times [2022-09-29 14:47:45,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499255621] [2022-09-29 14:47:45,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,338 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:45,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2094130847, now seen corresponding path program 1 times [2022-09-29 14:47:45,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594378774] [2022-09-29 14:47:45,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 14:47:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 14:47:45,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 14:47:45,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594378774] [2022-09-29 14:47:45,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594378774] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 14:47:45,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 14:47:45,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-29 14:47:45,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227058177] [2022-09-29 14:47:45,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 14:47:45,410 INFO L750 eck$LassoCheckResult]: loop already infeasible [2022-09-29 14:47:45,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 14:47:45,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-29 14:47:45,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-29 14:47:45,455 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) [2022-09-29 14:47:45,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-29 14:47:45,499 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2022-09-29 14:47:45,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 38 transitions. [2022-09-29 14:47:45,501 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2022-09-29 14:47:45,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 14 states and 23 transitions. [2022-09-29 14:47:45,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-09-29 14:47:45,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-09-29 14:47:45,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2022-09-29 14:47:45,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-29 14:47:45,506 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2022-09-29 14:47:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2022-09-29 14:47:45,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-09-29 14:47:45,528 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) [2022-09-29 14:47:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2022-09-29 14:47:45,530 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2022-09-29 14:47:45,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-29 14:47:45,535 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2022-09-29 14:47:45,535 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-09-29 14:47:45,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2022-09-29 14:47:45,536 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2022-09-29 14:47:45,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:47:45,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:47:45,537 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-09-29 14:47:45,537 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 14:47:45,537 INFO L733 eck$LassoCheckResult]: Stem: 97#[ULTIMATE.startENTRY]don't care [44] ULTIMATE.startENTRY-->L19-1: Formula: (and (= v_i_20 0) (= v_ctr_14 0)) InVars {} OutVars{i=v_i_20, ctr=v_ctr_14} AuxVars[] AssignedVars[i, ctr] 99#[L19-1]don't care [41] L19-1-->workerENTRY: 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] 101#[workerENTRY, L20]don't care [46] L20-->L19-1: Formula: (and (= (+ v_i_33 1) v_i_32) (not (< 0 v_i_33))) InVars {i=v_i_33} OutVars{i=v_i_32} AuxVars[] AssignedVars[i] 121#[workerENTRY, L19-1]don't care [39] L19-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 123#[workerENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2022-09-29 14:47:45,537 INFO L735 eck$LassoCheckResult]: Loop: 123#[workerENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [40] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 123#[workerENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2022-09-29 14:47:45,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2275191, now seen corresponding path program 1 times [2022-09-29 14:47:45,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259692856] [2022-09-29 14:47:45,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,548 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:45,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,553 INFO L85 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 1 times [2022-09-29 14:47:45,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129862314] [2022-09-29 14:47:45,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,556 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:45,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,558 INFO L85 PathProgramCache]: Analyzing trace with hash 70530961, now seen corresponding path program 1 times [2022-09-29 14:47:45,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088894667] [2022-09-29 14:47:45,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,564 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:45,627 WARN L146 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-09-29 14:47:45,633 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-29 14:47:45,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 22 transitions, 62 flow [2022-09-29 14:47:45,641 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:45,641 INFO L123 PetriNetUnfolderBase]: 4/32 cut-off events. [2022-09-29 14:47:45,641 INFO L124 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2022-09-29 14:47:45,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 32 events. 4/32 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 23. Up to 5 conditions per place. [2022-09-29 14:47:45,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 22 transitions, 62 flow [2022-09-29 14:47:45,643 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 22 transitions, 62 flow [2022-09-29 14:47:45,643 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 14:47:45,643 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 22 transitions, 62 flow [2022-09-29 14:47:45,643 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 22 transitions, 62 flow [2022-09-29 14:47:45,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 22 transitions, 62 flow [2022-09-29 14:47:45,649 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:45,649 INFO L123 PetriNetUnfolderBase]: 4/32 cut-off events. [2022-09-29 14:47:45,650 INFO L124 PetriNetUnfolderBase]: For 5/8 co-relation queries the response was YES. [2022-09-29 14:47:45,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 32 events. 4/32 cut-off events. For 5/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 23. Up to 5 conditions per place. [2022-09-29 14:47:45,651 INFO L116 LiptonReduction]: Number of co-enabled transitions 210 [2022-09-29 14:47:45,763 INFO L131 LiptonReduction]: Checked pairs total: 510 [2022-09-29 14:47:45,764 INFO L133 LiptonReduction]: Total number of compositions: 4 [2022-09-29 14:47:45,767 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 14:47:45,768 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 14:47:45,768 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 14:47:45,768 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 14:47:45,768 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 14:47:45,768 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 14:47:45,768 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 14:47:45,768 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-09-29 14:47:45,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-09-29 14:47:45,821 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 103 [2022-09-29 14:47:45,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:47:45,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:47:45,821 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-09-29 14:47:45,821 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-09-29 14:47:45,822 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 14:47:45,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 168 states, but on-demand construction may add more states [2022-09-29 14:47:45,828 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 103 [2022-09-29 14:47:45,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:47:45,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:47:45,829 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-09-29 14:47:45,829 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-09-29 14:47:45,831 INFO L733 eck$LassoCheckResult]: Stem: 27#[ULTIMATE.startENTRY]don't care [79] ULTIMATE.startENTRY-->L19-1: Formula: (and (= v_ctr_129 0) (= v_i_106 0)) InVars {} OutVars{i=v_i_106, ctr=v_ctr_129} AuxVars[] AssignedVars[i, ctr] 30#[L19-1]don't care [2022-09-29 14:47:45,831 INFO L735 eck$LassoCheckResult]: Loop: 30#[L19-1]don't care [73] L19-1-->workerENTRY: 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] 34#[L20, workerENTRY]don't care [66] workerENTRY-->L30: Formula: (= (+ v_i_6 v_ctr_3) v_ctr_2) InVars {i=v_i_6, ctr=v_ctr_3} OutVars{i=v_i_6, ctr=v_ctr_2} AuxVars[] AssignedVars[ctr] 38#[L30, L20]don't care [68] L30-->L31: Formula: (<= v_ctr_5 (* 2 v_i_8)) InVars {i=v_i_8, ctr=v_ctr_5} OutVars{i=v_i_8, ctr=v_ctr_5} AuxVars[] AssignedVars[] 50#[L31, L20]don't care [78] L31-->workerEXIT: Formula: (= v_ctr_125 (+ (* (- 1) v_i_104) v_ctr_126)) InVars {i=v_i_104, ctr=v_ctr_126} OutVars{i=v_i_104, ctr=v_ctr_125} AuxVars[] AssignedVars[ctr] 72#[L20, workerEXIT]don't care [59] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[] 102#[workerEXIT, L21]don't care [75] 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[] 146#[L21-2]don't care [57] 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] 30#[L19-1]don't care [2022-09-29 14:47:45,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,832 INFO L85 PathProgramCache]: Analyzing trace with hash 110, now seen corresponding path program 1 times [2022-09-29 14:47:45,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375505732] [2022-09-29 14:47:45,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,839 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:45,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash -234191515, now seen corresponding path program 1 times [2022-09-29 14:47:45,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792162571] [2022-09-29 14:47:45,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 14:47:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 14:47:45,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 14:47:45,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792162571] [2022-09-29 14:47:45,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792162571] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 14:47:45,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 14:47:45,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-29 14:47:45,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979813881] [2022-09-29 14:47:45,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 14:47:45,866 INFO L750 eck$LassoCheckResult]: loop already infeasible [2022-09-29 14:47:45,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 14:47:45,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-29 14:47:45,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-29 14:47:45,867 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) [2022-09-29 14:47:45,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-29 14:47:45,927 INFO L93 Difference]: Finished difference Result 223 states and 554 transitions. [2022-09-29 14:47:45,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 554 transitions. [2022-09-29 14:47:45,939 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 119 [2022-09-29 14:47:45,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 176 states and 444 transitions. [2022-09-29 14:47:45,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 176 [2022-09-29 14:47:45,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 176 [2022-09-29 14:47:45,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 176 states and 444 transitions. [2022-09-29 14:47:45,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-29 14:47:45,946 INFO L218 hiAutomatonCegarLoop]: Abstraction has 176 states and 444 transitions. [2022-09-29 14:47:45,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states and 444 transitions. [2022-09-29 14:47:45,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 162. [2022-09-29 14:47:45,960 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) [2022-09-29 14:47:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 418 transitions. [2022-09-29 14:47:45,961 INFO L240 hiAutomatonCegarLoop]: Abstraction has 162 states and 418 transitions. [2022-09-29 14:47:45,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-29 14:47:45,964 INFO L428 stractBuchiCegarLoop]: Abstraction has 162 states and 418 transitions. [2022-09-29 14:47:45,964 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-09-29 14:47:45,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 418 transitions. [2022-09-29 14:47:45,967 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 115 [2022-09-29 14:47:45,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:47:45,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:47:45,969 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-09-29 14:47:45,969 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-09-29 14:47:45,969 INFO L733 eck$LassoCheckResult]: Stem: 881#[ULTIMATE.startENTRY]don't care [79] ULTIMATE.startENTRY-->L19-1: Formula: (and (= v_ctr_129 0) (= v_i_106 0)) InVars {} OutVars{i=v_i_106, ctr=v_ctr_129} AuxVars[] AssignedVars[i, ctr] 861#[L19-1]don't care [73] L19-1-->workerENTRY: 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] 863#[L20, workerENTRY]don't care [80] L20-->L19-1: Formula: (and (not (< 0 v_i_109)) (= (+ v_i_109 1) v_i_108)) InVars {i=v_i_109} OutVars{i=v_i_108} AuxVars[] AssignedVars[i] 739#[L19-1, workerENTRY]don't care [2022-09-29 14:47:45,972 INFO L735 eck$LassoCheckResult]: Loop: 739#[L19-1, workerENTRY]don't care [74] L19-1-->workerENTRY: 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] 687#[L20, workerENTRY, workerENTRY]don't care [61] workerENTRY-->L30: Formula: (= (+ v_i_6 v_ctr_3) v_ctr_2) InVars {i=v_i_6, ctr=v_ctr_3} OutVars{i=v_i_6, ctr=v_ctr_2} AuxVars[] AssignedVars[ctr] 695#[L20, L30, workerENTRY]don't care [59] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[] 791#[L30, L21, workerENTRY]don't care [63] L30-->L31: Formula: (<= v_ctr_5 (* 2 v_i_8)) InVars {i=v_i_8, ctr=v_ctr_5} OutVars{i=v_i_8, ctr=v_ctr_5} AuxVars[] AssignedVars[] 811#[L31, L21, workerENTRY]don't care [77] L31-->workerEXIT: Formula: (= (+ (* (- 1) v_i_96) v_ctr_112) v_ctr_111) InVars {i=v_i_96, ctr=v_ctr_112} OutVars{i=v_i_96, ctr=v_ctr_111} AuxVars[] AssignedVars[ctr] 613#[workerEXIT, L21, workerENTRY]don't care [76] workerEXIT-->L21-2: Formula: (= (+ (- 1) v_i_63) v_workerThread2of2ForFork0_thidvar0_4) InVars {workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_63} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_63} AuxVars[] AssignedVars[] 737#[L21-2, workerENTRY]don't care [57] 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] 739#[L19-1, workerENTRY]don't care [2022-09-29 14:47:45,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,973 INFO L85 PathProgramCache]: Analyzing trace with hash 108053, now seen corresponding path program 1 times [2022-09-29 14:47:45,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825858188] [2022-09-29 14:47:45,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,982 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:45,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,986 INFO L85 PathProgramCache]: Analyzing trace with hash 501425186, now seen corresponding path program 1 times [2022-09-29 14:47:45,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412516216] [2022-09-29 14:47:45,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 14:47:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 14:47:46,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 14:47:46,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412516216] [2022-09-29 14:47:46,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412516216] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 14:47:46,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 14:47:46,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-29 14:47:46,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373074957] [2022-09-29 14:47:46,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 14:47:46,011 INFO L750 eck$LassoCheckResult]: loop already infeasible [2022-09-29 14:47:46,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 14:47:46,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-29 14:47:46,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-29 14:47:46,012 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) [2022-09-29 14:47:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-29 14:47:46,060 INFO L93 Difference]: Finished difference Result 171 states and 430 transitions. [2022-09-29 14:47:46,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 430 transitions. [2022-09-29 14:47:46,062 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 105 [2022-09-29 14:47:46,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 167 states and 419 transitions. [2022-09-29 14:47:46,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2022-09-29 14:47:46,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2022-09-29 14:47:46,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 419 transitions. [2022-09-29 14:47:46,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-29 14:47:46,067 INFO L218 hiAutomatonCegarLoop]: Abstraction has 167 states and 419 transitions. [2022-09-29 14:47:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 419 transitions. [2022-09-29 14:47:46,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2022-09-29 14:47:46,081 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) [2022-09-29 14:47:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 418 transitions. [2022-09-29 14:47:46,082 INFO L240 hiAutomatonCegarLoop]: Abstraction has 166 states and 418 transitions. [2022-09-29 14:47:46,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-29 14:47:46,083 INFO L428 stractBuchiCegarLoop]: Abstraction has 166 states and 418 transitions. [2022-09-29 14:47:46,084 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-09-29 14:47:46,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 418 transitions. [2022-09-29 14:47:46,085 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 105 [2022-09-29 14:47:46,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:47:46,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:47:46,086 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-09-29 14:47:46,086 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-29 14:47:46,086 INFO L733 eck$LassoCheckResult]: Stem: 1376#[ULTIMATE.startENTRY]don't care [79] ULTIMATE.startENTRY-->L19-1: Formula: (and (= v_ctr_129 0) (= v_i_106 0)) InVars {} OutVars{i=v_i_106, ctr=v_ctr_129} AuxVars[] AssignedVars[i, ctr] 1352#[L19-1]don't care [73] L19-1-->workerENTRY: 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] 1354#[L20, workerENTRY]don't care [80] L20-->L19-1: Formula: (and (not (< 0 v_i_109)) (= (+ v_i_109 1) v_i_108)) InVars {i=v_i_109} OutVars{i=v_i_108} AuxVars[] AssignedVars[i] 1230#[L19-1, workerENTRY]don't care [2022-09-29 14:47:46,087 INFO L735 eck$LassoCheckResult]: Loop: 1230#[L19-1, workerENTRY]don't care [66] workerENTRY-->L30: Formula: (= (+ v_i_6 v_ctr_3) v_ctr_2) InVars {i=v_i_6, ctr=v_ctr_3} OutVars{i=v_i_6, ctr=v_ctr_2} AuxVars[] AssignedVars[ctr] 1318#[L30, L19-1]don't care [68] L30-->L31: Formula: (<= v_ctr_5 (* 2 v_i_8)) InVars {i=v_i_8, ctr=v_ctr_5} OutVars{i=v_i_8, ctr=v_ctr_5} AuxVars[] AssignedVars[] 1260#[L31, L19-1]don't care [74] L19-1-->workerENTRY: 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] 1330#[L20, workerENTRY, L31]don't care [78] L31-->workerEXIT: Formula: (= v_ctr_125 (+ (* (- 1) v_i_104) v_ctr_126)) InVars {i=v_i_104, ctr=v_ctr_126} OutVars{i=v_i_104, ctr=v_ctr_125} AuxVars[] AssignedVars[ctr] 1368#[L20, workerENTRY, workerEXIT]don't care [61] workerENTRY-->L30: Formula: (= (+ v_i_6 v_ctr_3) v_ctr_2) InVars {i=v_i_6, ctr=v_ctr_3} OutVars{i=v_i_6, ctr=v_ctr_2} AuxVars[] AssignedVars[ctr] 1416#[L20, workerEXIT, L30]don't care [59] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[] 1414#[workerEXIT, L21, L30]don't care [63] L30-->L31: Formula: (<= v_ctr_5 (* 2 v_i_8)) InVars {i=v_i_8, ctr=v_ctr_5} OutVars{i=v_i_8, ctr=v_ctr_5} AuxVars[] AssignedVars[] 1298#[L31, L21, workerEXIT]don't care [77] L31-->workerEXIT: Formula: (= (+ (* (- 1) v_i_96) v_ctr_112) v_ctr_111) InVars {i=v_i_96, ctr=v_ctr_112} OutVars{i=v_i_96, ctr=v_ctr_111} AuxVars[] AssignedVars[ctr] 1374#[workerEXIT, L21, workerEXIT]don't care [75] 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[] 1278#[workerEXIT, L21-2]don't care [57] 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] 1310#[workerEXIT, L19-1]don't care [73] L19-1-->workerENTRY: 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] 1312#[L20, workerEXIT, workerENTRY]don't care [59] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[] 1412#[workerEXIT, L21, workerENTRY]don't care [76] workerEXIT-->L21-2: Formula: (= (+ (- 1) v_i_63) v_workerThread2of2ForFork0_thidvar0_4) InVars {workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_63} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_63} AuxVars[] AssignedVars[] 1226#[L21-2, workerENTRY]don't care [57] 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] 1230#[L19-1, workerENTRY]don't care [2022-09-29 14:47:46,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:46,087 INFO L85 PathProgramCache]: Analyzing trace with hash 108053, now seen corresponding path program 2 times [2022-09-29 14:47:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:46,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240667809] [2022-09-29 14:47:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:46,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:46,092 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:46,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:46,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:46,096 INFO L85 PathProgramCache]: Analyzing trace with hash -451964128, now seen corresponding path program 1 times [2022-09-29 14:47:46,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:46,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014634095] [2022-09-29 14:47:46,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:46,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:46,106 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:46,127 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: No thread ID for procedure ULTIMATE.start at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.createThreadIds(IcfgProgramExecution.java:200) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:149) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:97) 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:431) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:381) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:357) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:222) 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:209) 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:866) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopFeasibility(LassoCheck.java:828) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:748) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:254) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-09-29 14:47:46,130 INFO L158 Benchmark]: Toolchain (without parser) took 1553.51ms. Allocated memory is still 166.7MB. Free memory was 125.3MB in the beginning and 100.7MB in the end (delta: 24.6MB). Peak memory consumption was 24.8MB. Max. memory is 8.0GB. [2022-09-29 14:47:46,131 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 166.7MB. Free memory was 126.4MB in the beginning and 126.3MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 14:47:46,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.85ms. Allocated memory is still 166.7MB. Free memory was 125.3MB in the beginning and 123.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-29 14:47:46,132 INFO L158 Benchmark]: Boogie Preprocessor took 16.14ms. Allocated memory is still 166.7MB. Free memory was 123.8MB in the beginning and 122.9MB in the end (delta: 940.3kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-29 14:47:46,132 INFO L158 Benchmark]: RCFGBuilder took 210.15ms. Allocated memory is still 166.7MB. Free memory was 122.9MB in the beginning and 114.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-09-29 14:47:46,133 INFO L158 Benchmark]: BuchiAutomizer took 1298.93ms. Allocated memory is still 166.7MB. Free memory was 114.4MB in the beginning and 100.7MB in the end (delta: 13.7MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2022-09-29 14:47:46,135 INFO L339 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.16ms. Allocated memory is still 166.7MB. Free memory was 126.4MB in the beginning and 126.3MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.85ms. Allocated memory is still 166.7MB. Free memory was 125.3MB in the beginning and 123.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.14ms. Allocated memory is still 166.7MB. Free memory was 123.8MB in the beginning and 122.9MB in the end (delta: 940.3kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 210.15ms. Allocated memory is still 166.7MB. Free memory was 122.9MB in the beginning and 114.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1298.93ms. Allocated memory is still 166.7MB. Free memory was 114.4MB in the beginning and 100.7MB in the end (delta: 13.7MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 16 PlacesBefore, 13 PlacesAfterwards, 15 TransitionsBefore, 12 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 107 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 101, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 52, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 52, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 101, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 52, unknown conditional: 0, unknown unconditional: 52] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 24 PlacesBefore, 21 PlacesAfterwards, 22 TransitionsBefore, 19 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 510 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 256, positive: 228, positive conditional: 0, positive unconditional: 228, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, positive: 118, positive conditional: 0, positive unconditional: 118, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, positive: 113, positive conditional: 0, positive unconditional: 113, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 256, positive: 110, positive conditional: 0, positive unconditional: 110, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - ExceptionOrErrorResult: AssertionError: No thread ID for procedure ULTIMATE.start de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: No thread ID for procedure ULTIMATE.start: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.createThreadIds(IcfgProgramExecution.java:200) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-09-29 14:47:46,169 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...