/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/fork_loop_noop.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 03:09:46,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 03:09:46,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 03:09:46,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 03:09:46,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 03:09:46,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 03:09:46,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 03:09:46,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 03:09:46,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 03:09:46,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 03:09:46,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 03:09:46,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 03:09:46,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 03:09:46,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 03:09:46,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 03:09:46,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 03:09:46,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 03:09:46,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 03:09:46,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 03:09:46,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 03:09:46,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 03:09:46,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 03:09:46,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 03:09:46,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 03:09:46,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 03:09:46,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 03:09:46,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 03:09:46,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 03:09:46,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 03:09:46,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 03:09:46,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 03:09:46,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 03:09:46,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 03:09:46,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 03:09:46,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 03:09:46,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 03:09:46,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 03:09:46,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 03:09:46,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 03:09:46,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 03:09:46,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 03:09:46,212 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-05 03:09:46,235 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 03:09:46,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 03:09:46,235 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 03:09:46,236 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 03:09:46,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 03:09:46,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 03:09:46,237 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 03:09:46,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 03:09:46,237 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 03:09:46,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 03:09:46,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 03:09:46,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 03:09:46,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 03:09:46,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 03:09:46,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 03:09:46,239 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 03:09:46,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 03:09:46,239 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 03:09:46,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 03:09:46,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 03:09:46,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 03:09:46,240 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 03:09:46,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 03:09:46,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 03:09:46,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 03:09:46,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 03:09:46,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 03:09:46,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 03:09:46,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 03:09:46,241 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 03:09:46,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 03:09:46,241 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2021-06-05 03:09:46,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 03:09:46,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 03:09:46,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 03:09:46,588 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 03:09:46,590 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 03:09:46,591 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/fork_loop_noop.bpl [2021-06-05 03:09:46,591 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/fork_loop_noop.bpl' [2021-06-05 03:09:46,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 03:09:46,624 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 03:09:46,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 03:09:46,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 03:09:46,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 03:09:46,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:46" (1/1) ... [2021-06-05 03:09:46,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:46" (1/1) ... [2021-06-05 03:09:46,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 03:09:46,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 03:09:46,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 03:09:46,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 03:09:46,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:46" (1/1) ... [2021-06-05 03:09:46,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:46" (1/1) ... [2021-06-05 03:09:46,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:46" (1/1) ... [2021-06-05 03:09:46,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:46" (1/1) ... [2021-06-05 03:09:46,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:46" (1/1) ... [2021-06-05 03:09:46,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:46" (1/1) ... [2021-06-05 03:09:46,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:46" (1/1) ... [2021-06-05 03:09:46,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 03:09:46,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 03:09:46,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 03:09:46,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 03:09:46,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 03:09:46,715 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 03:09:46,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 03:09:46,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 03:09:46,715 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2021-06-05 03:09:46,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2021-06-05 03:09:46,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2021-06-05 03:09:46,716 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 03:09:46,815 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 03:09:46,815 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-06-05 03:09:46,816 INFO L202 PluginConnector]: Adding new model fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 03:09:46 BoogieIcfgContainer [2021-06-05 03:09:46,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 03:09:46,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 03:09:46,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 03:09:46,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 03:09:46,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:46" (1/2) ... [2021-06-05 03:09:46,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486bbae6 and model type fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 03:09:46, skipping insertion in model container [2021-06-05 03:09:46,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 03:09:46" (2/2) ... [2021-06-05 03:09:46,823 INFO L111 eAbstractionObserver]: Analyzing ICFG fork_loop_noop.bpl [2021-06-05 03:09:46,828 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 03:09:46,828 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 03:09:46,828 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 03:09:46,829 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 03:09:46,846 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:46,861 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:46,879 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:46,879 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:46,879 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:46,880 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:46,880 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:46,880 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:46,880 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:46,880 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:46,887 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 11 places, 8 transitions, 21 flow [2021-06-05 03:09:46,895 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 20 states, 15 states have (on average 1.8) internal successors, (27), 19 states have internal predecessors, (27), 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) [2021-06-05 03:09:46,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 19 states have internal predecessors, (27), 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) [2021-06-05 03:09:46,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:09:46,902 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:46,902 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:09:46,903 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:46,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:46,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1315, now seen corresponding path program 1 times [2021-06-05 03:09:46,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:46,915 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023945770] [2021-06-05 03:09:46,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:47,021 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:47,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023945770] [2021-06-05 03:09:47,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023945770] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:47,022 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:47,022 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:09:47,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084505707] [2021-06-05 03:09:47,025 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:47,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:47,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:47,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:47,038 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 19 states have internal predecessors, (27), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:09:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:47,050 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2021-06-05 03:09:47,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:47,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-06-05 03:09:47,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:47,057 INFO L225 Difference]: With dead ends: 16 [2021-06-05 03:09:47,057 INFO L226 Difference]: Without dead ends: 8 [2021-06-05 03:09:47,058 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-06-05 03:09:47,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-06-05 03:09:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:09:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-06-05 03:09:47,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 2 [2021-06-05 03:09:47,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:47,080 INFO L482 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-06-05 03:09:47,081 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:09:47,081 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2021-06-05 03:09:47,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-06-05 03:09:47,081 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:47,081 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-06-05 03:09:47,081 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 03:09:47,082 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:47,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:47,082 INFO L82 PathProgramCache]: Analyzing trace with hash 41033, now seen corresponding path program 1 times [2021-06-05 03:09:47,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:47,083 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027508238] [2021-06-05 03:09:47,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:47,087 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:47,089 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:47,100 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:47,100 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:47,101 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 03:09:47,101 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:47,101 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 03:09:47,107 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:47,108 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:47,109 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:47,109 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:47,110 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:47,110 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:47,110 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:47,110 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:47,110 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:47,110 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:47,111 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 16 places, 11 transitions, 34 flow [2021-06-05 03:09:47,116 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 62 states, 55 states have (on average 2.2) internal successors, (121), 61 states have internal predecessors, (121), 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) [2021-06-05 03:09:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 55 states have (on average 2.2) internal successors, (121), 61 states have internal predecessors, (121), 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) [2021-06-05 03:09:47,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:09:47,117 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:47,118 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:09:47,118 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:47,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:47,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2021-06-05 03:09:47,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:47,119 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362313230] [2021-06-05 03:09:47,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:47,129 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:47,129 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362313230] [2021-06-05 03:09:47,129 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362313230] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:47,129 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:47,129 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:09:47,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140382940] [2021-06-05 03:09:47,130 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:47,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:47,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:47,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:47,131 INFO L87 Difference]: Start difference. First operand has 62 states, 55 states have (on average 2.2) internal successors, (121), 61 states have internal predecessors, (121), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:09:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:47,136 INFO L93 Difference]: Finished difference Result 49 states and 94 transitions. [2021-06-05 03:09:47,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:47,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-06-05 03:09:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:47,138 INFO L225 Difference]: With dead ends: 49 [2021-06-05 03:09:47,138 INFO L226 Difference]: Without dead ends: 23 [2021-06-05 03:09:47,138 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-06-05 03:09:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-06-05 03:09:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 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) [2021-06-05 03:09:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. [2021-06-05 03:09:47,143 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 40 transitions. Word has length 2 [2021-06-05 03:09:47,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:47,143 INFO L482 AbstractCegarLoop]: Abstraction has 23 states and 40 transitions. [2021-06-05 03:09:47,143 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:09:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 40 transitions. [2021-06-05 03:09:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-06-05 03:09:47,144 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:47,144 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-06-05 03:09:47,144 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 03:09:47,144 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:47,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:47,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1612715, now seen corresponding path program 1 times [2021-06-05 03:09:47,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:47,145 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665190487] [2021-06-05 03:09:47,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:47,148 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:47,151 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:47,152 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:47,152 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:47,152 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 03:09:47,153 WARN L242 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:47,153 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2021-06-05 03:09:47,160 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:47,160 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:47,161 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:47,161 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:47,161 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:47,162 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:47,162 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:47,162 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:47,162 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:47,162 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:47,163 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 21 places, 14 transitions, 49 flow [2021-06-05 03:09:47,193 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 188 states, 179 states have (on average 2.7206703910614527) internal successors, (487), 187 states have internal predecessors, (487), 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) [2021-06-05 03:09:47,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 179 states have (on average 2.7206703910614527) internal successors, (487), 187 states have internal predecessors, (487), 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) [2021-06-05 03:09:47,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:09:47,195 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:47,195 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:09:47,196 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:47,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:47,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2115, now seen corresponding path program 1 times [2021-06-05 03:09:47,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:47,197 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915025108] [2021-06-05 03:09:47,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:47,233 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:47,233 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915025108] [2021-06-05 03:09:47,233 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915025108] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:47,234 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:47,234 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:09:47,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782061356] [2021-06-05 03:09:47,234 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:47,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:47,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:47,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:47,237 INFO L87 Difference]: Start difference. First operand has 188 states, 179 states have (on average 2.7206703910614527) internal successors, (487), 187 states have internal predecessors, (487), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:09:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:47,251 INFO L93 Difference]: Finished difference Result 148 states and 379 transitions. [2021-06-05 03:09:47,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:47,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-06-05 03:09:47,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:47,267 INFO L225 Difference]: With dead ends: 148 [2021-06-05 03:09:47,267 INFO L226 Difference]: Without dead ends: 68 [2021-06-05 03:09:47,267 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:47,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-06-05 03:09:47,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-06-05 03:09:47,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 2.4328358208955225) internal successors, (163), 67 states have internal predecessors, (163), 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) [2021-06-05 03:09:47,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 163 transitions. [2021-06-05 03:09:47,291 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 163 transitions. Word has length 2 [2021-06-05 03:09:47,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:47,291 INFO L482 AbstractCegarLoop]: Abstraction has 68 states and 163 transitions. [2021-06-05 03:09:47,291 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:09:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 163 transitions. [2021-06-05 03:09:47,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-06-05 03:09:47,292 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:47,292 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-06-05 03:09:47,292 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 03:09:47,292 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:47,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:47,293 INFO L82 PathProgramCache]: Analyzing trace with hash 63416129, now seen corresponding path program 1 times [2021-06-05 03:09:47,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:47,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917182491] [2021-06-05 03:09:47,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:47,298 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:47,300 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:47,312 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:47,312 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:47,312 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 03:09:47,313 WARN L242 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:47,313 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2021-06-05 03:09:47,344 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:47,344 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:47,345 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:47,346 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:47,346 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:47,346 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:47,346 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:47,346 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:47,346 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:47,346 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:47,347 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 17 transitions, 66 flow [2021-06-05 03:09:47,393 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 566 states, 555 states have (on average 3.30990990990991) internal successors, (1837), 565 states have internal predecessors, (1837), 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) [2021-06-05 03:09:47,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 566 states, 555 states have (on average 3.30990990990991) internal successors, (1837), 565 states have internal predecessors, (1837), 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) [2021-06-05 03:09:47,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:09:47,396 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:47,396 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:09:47,397 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:47,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:47,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2659, now seen corresponding path program 1 times [2021-06-05 03:09:47,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:47,398 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670548252] [2021-06-05 03:09:47,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:47,408 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:47,408 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670548252] [2021-06-05 03:09:47,408 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670548252] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:47,409 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:47,409 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:09:47,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030400435] [2021-06-05 03:09:47,409 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:47,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:47,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:47,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:47,412 INFO L87 Difference]: Start difference. First operand has 566 states, 555 states have (on average 3.30990990990991) internal successors, (1837), 565 states have internal predecessors, (1837), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:09:47,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:47,437 INFO L93 Difference]: Finished difference Result 445 states and 1432 transitions. [2021-06-05 03:09:47,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:47,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-06-05 03:09:47,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:47,441 INFO L225 Difference]: With dead ends: 445 [2021-06-05 03:09:47,441 INFO L226 Difference]: Without dead ends: 203 [2021-06-05 03:09:47,442 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-06-05 03:09:47,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2021-06-05 03:09:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 3.0792079207920793) internal successors, (622), 202 states have internal predecessors, (622), 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) [2021-06-05 03:09:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 622 transitions. [2021-06-05 03:09:47,469 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 622 transitions. Word has length 2 [2021-06-05 03:09:47,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:47,469 INFO L482 AbstractCegarLoop]: Abstraction has 203 states and 622 transitions. [2021-06-05 03:09:47,469 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:09:47,469 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 622 transitions. [2021-06-05 03:09:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-06-05 03:09:47,470 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:47,470 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-06-05 03:09:47,470 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 03:09:47,470 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:47,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:47,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1824239762, now seen corresponding path program 1 times [2021-06-05 03:09:47,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:47,471 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612756920] [2021-06-05 03:09:47,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:47,476 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:47,478 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:47,480 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:47,480 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:47,481 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 03:09:47,481 WARN L242 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:47,481 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2021-06-05 03:09:47,491 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:47,492 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:47,493 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:47,493 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:47,493 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:47,493 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:47,493 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:47,493 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:47,493 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:47,494 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:47,495 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 20 transitions, 85 flow [2021-06-05 03:09:47,587 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1700 states, 1687 states have (on average 3.9377593360995853) internal successors, (6643), 1699 states have internal predecessors, (6643), 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) [2021-06-05 03:09:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 1700 states, 1687 states have (on average 3.9377593360995853) internal successors, (6643), 1699 states have internal predecessors, (6643), 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) [2021-06-05 03:09:47,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:09:47,593 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:47,593 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:09:47,593 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:47,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:47,594 INFO L82 PathProgramCache]: Analyzing trace with hash 3299, now seen corresponding path program 1 times [2021-06-05 03:09:47,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:47,594 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835383713] [2021-06-05 03:09:47,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:47,604 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:47,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835383713] [2021-06-05 03:09:47,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835383713] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:47,605 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:47,605 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:09:47,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774971051] [2021-06-05 03:09:47,605 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:47,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:47,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:47,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:47,613 INFO L87 Difference]: Start difference. First operand has 1700 states, 1687 states have (on average 3.9377593360995853) internal successors, (6643), 1699 states have internal predecessors, (6643), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:09:47,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:47,633 INFO L93 Difference]: Finished difference Result 1336 states and 5185 transitions. [2021-06-05 03:09:47,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:47,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-06-05 03:09:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:47,642 INFO L225 Difference]: With dead ends: 1336 [2021-06-05 03:09:47,642 INFO L226 Difference]: Without dead ends: 608 [2021-06-05 03:09:47,642 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:47,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-06-05 03:09:47,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2021-06-05 03:09:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 3.7380560131795715) internal successors, (2269), 607 states have internal predecessors, (2269), 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) [2021-06-05 03:09:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 2269 transitions. [2021-06-05 03:09:47,693 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 2269 transitions. Word has length 2 [2021-06-05 03:09:47,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:47,693 INFO L482 AbstractCegarLoop]: Abstraction has 608 states and 2269 transitions. [2021-06-05 03:09:47,693 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:09:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 2269 transitions. [2021-06-05 03:09:47,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-06-05 03:09:47,694 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:47,694 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:47,694 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 03:09:47,695 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:47,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:47,695 INFO L82 PathProgramCache]: Analyzing trace with hash 504182917, now seen corresponding path program 1 times [2021-06-05 03:09:47,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:47,695 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052873567] [2021-06-05 03:09:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:47,700 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:47,702 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:47,704 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:47,704 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:47,705 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 03:09:47,705 WARN L242 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:47,705 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2021-06-05 03:09:47,716 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:47,716 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:47,717 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:47,717 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:47,718 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:47,718 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:47,718 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:47,718 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:47,718 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:47,718 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:47,719 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 23 transitions, 106 flow [2021-06-05 03:09:48,209 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5102 states, 5087 states have (on average 4.586003538431296) internal successors, (23329), 5101 states have internal predecessors, (23329), 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) [2021-06-05 03:09:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 5102 states, 5087 states have (on average 4.586003538431296) internal successors, (23329), 5101 states have internal predecessors, (23329), 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) [2021-06-05 03:09:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:09:48,229 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:48,229 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:09:48,230 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:48,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:48,230 INFO L82 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 1 times [2021-06-05 03:09:48,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:48,231 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900622500] [2021-06-05 03:09:48,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:48,260 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:48,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900622500] [2021-06-05 03:09:48,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900622500] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:48,261 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:48,261 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:09:48,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638532137] [2021-06-05 03:09:48,261 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:48,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:48,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:48,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:48,282 INFO L87 Difference]: Start difference. First operand has 5102 states, 5087 states have (on average 4.586003538431296) internal successors, (23329), 5101 states have internal predecessors, (23329), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:09:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:48,355 INFO L93 Difference]: Finished difference Result 4009 states and 18226 transitions. [2021-06-05 03:09:48,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:48,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-06-05 03:09:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:48,373 INFO L225 Difference]: With dead ends: 4009 [2021-06-05 03:09:48,374 INFO L226 Difference]: Without dead ends: 1823 [2021-06-05 03:09:48,375 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:48,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2021-06-05 03:09:48,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1823. [2021-06-05 03:09:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1823 states, 1822 states have (on average 4.401756311745335) internal successors, (8020), 1822 states have internal predecessors, (8020), 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) [2021-06-05 03:09:48,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 8020 transitions. [2021-06-05 03:09:48,534 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 8020 transitions. Word has length 2 [2021-06-05 03:09:48,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:48,534 INFO L482 AbstractCegarLoop]: Abstraction has 1823 states and 8020 transitions. [2021-06-05 03:09:48,534 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:09:48,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 8020 transitions. [2021-06-05 03:09:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-06-05 03:09:48,537 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:48,537 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:48,537 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 03:09:48,537 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:48,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:48,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1332075505, now seen corresponding path program 1 times [2021-06-05 03:09:48,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:48,539 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502093912] [2021-06-05 03:09:48,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:48,556 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:48,565 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:48,570 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:48,570 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:48,570 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 03:09:48,571 WARN L242 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:48,571 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2021-06-05 03:09:48,588 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:48,588 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:48,590 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:48,590 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:48,591 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:48,591 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:48,591 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:48,591 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:48,591 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:48,591 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:48,593 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 26 transitions, 129 flow [2021-06-05 03:09:50,038 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 15308 states, 15291 states have (on average 5.244326728140736) internal successors, (80191), 15307 states have internal predecessors, (80191), 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) [2021-06-05 03:09:50,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 15308 states, 15291 states have (on average 5.244326728140736) internal successors, (80191), 15307 states have internal predecessors, (80191), 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) [2021-06-05 03:09:50,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:09:50,070 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:50,070 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:09:50,070 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:50,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash 4867, now seen corresponding path program 1 times [2021-06-05 03:09:50,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:50,071 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967174229] [2021-06-05 03:09:50,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:50,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:50,096 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:50,096 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967174229] [2021-06-05 03:09:50,097 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967174229] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:50,097 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:50,097 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:09:50,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528571831] [2021-06-05 03:09:50,097 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:50,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:50,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:50,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:50,129 INFO L87 Difference]: Start difference. First operand has 15308 states, 15291 states have (on average 5.244326728140736) internal successors, (80191), 15307 states have internal predecessors, (80191), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:09:50,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:50,315 INFO L93 Difference]: Finished difference Result 12028 states and 62695 transitions. [2021-06-05 03:09:50,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:50,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-06-05 03:09:50,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:50,365 INFO L225 Difference]: With dead ends: 12028 [2021-06-05 03:09:50,365 INFO L226 Difference]: Without dead ends: 5468 [2021-06-05 03:09:50,365 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:50,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2021-06-05 03:09:50,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 5468. [2021-06-05 03:09:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5468 states, 5467 states have (on average 5.06731296872142) internal successors, (27703), 5467 states have internal predecessors, (27703), 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) [2021-06-05 03:09:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 27703 transitions. [2021-06-05 03:09:50,934 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 27703 transitions. Word has length 2 [2021-06-05 03:09:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:50,934 INFO L482 AbstractCegarLoop]: Abstraction has 5468 states and 27703 transitions. [2021-06-05 03:09:50,934 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:09:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 27703 transitions. [2021-06-05 03:09:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-06-05 03:09:50,939 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:50,940 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:50,940 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 03:09:50,940 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:50,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:50,941 INFO L82 PathProgramCache]: Analyzing trace with hash 58177429, now seen corresponding path program 1 times [2021-06-05 03:09:50,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:50,941 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169814778] [2021-06-05 03:09:50,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:50,952 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:51,012 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:51,014 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:51,015 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:51,015 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 03:09:51,015 WARN L242 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:51,015 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2021-06-05 03:09:51,040 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:51,041 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:51,041 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:51,041 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:51,041 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:51,042 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:51,042 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:51,042 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:51,042 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:51,042 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:51,043 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 29 transitions, 154 flow [2021-06-05 03:10:04,404 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 45926 states, 45907 states have (on average 5.907356176617945) internal successors, (271189), 45925 states have internal predecessors, (271189), 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) [2021-06-05 03:10:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 45926 states, 45907 states have (on average 5.907356176617945) internal successors, (271189), 45925 states have internal predecessors, (271189), 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) [2021-06-05 03:10:04,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:10:04,480 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:10:04,484 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:10:04,485 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:10:04,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:10:04,485 INFO L82 PathProgramCache]: Analyzing trace with hash 5795, now seen corresponding path program 1 times [2021-06-05 03:10:04,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:10:04,485 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143364593] [2021-06-05 03:10:04,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:10:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:10:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:10:04,493 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:10:04,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143364593] [2021-06-05 03:10:04,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143364593] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:10:04,494 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:10:04,494 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:10:04,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430571117] [2021-06-05 03:10:04,494 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:10:04,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:10:04,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:10:04,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:10:04,573 INFO L87 Difference]: Start difference. First operand has 45926 states, 45907 states have (on average 5.907356176617945) internal successors, (271189), 45925 states have internal predecessors, (271189), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:10:05,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:10:05,191 INFO L93 Difference]: Finished difference Result 36085 states and 212140 transitions. [2021-06-05 03:10:05,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:10:05,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-06-05 03:10:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:10:05,395 INFO L225 Difference]: With dead ends: 36085 [2021-06-05 03:10:05,395 INFO L226 Difference]: Without dead ends: 16403 [2021-06-05 03:10:05,395 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:10:06,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16403 states. [2021-06-05 03:10:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16403 to 16403. [2021-06-05 03:10:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16403 states, 16402 states have (on average 5.733569076941836) internal successors, (94042), 16402 states have internal predecessors, (94042), 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) [2021-06-05 03:10:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16403 states to 16403 states and 94042 transitions. [2021-06-05 03:10:07,238 INFO L78 Accepts]: Start accepts. Automaton has 16403 states and 94042 transitions. Word has length 2 [2021-06-05 03:10:07,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:10:07,239 INFO L482 AbstractCegarLoop]: Abstraction has 16403 states and 94042 transitions. [2021-06-05 03:10:07,239 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:10:07,239 INFO L276 IsEmpty]: Start isEmpty. Operand 16403 states and 94042 transitions. [2021-06-05 03:10:07,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-06-05 03:10:07,241 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:10:07,241 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:10:07,241 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 03:10:07,242 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:10:07,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:10:07,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1055505844, now seen corresponding path program 1 times [2021-06-05 03:10:07,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:10:07,243 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033418577] [2021-06-05 03:10:07,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:10:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:10:07,247 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:10:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:10:07,249 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:10:07,251 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:10:07,251 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:10:07,252 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 03:10:07,252 WARN L242 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:10:07,252 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2021-06-05 03:10:07,265 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:10:07,265 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:10:07,266 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:10:07,266 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:10:07,266 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:10:07,266 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:10:07,266 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:10:07,266 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:10:07,266 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:10:07,266 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:10:07,267 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 32 transitions, 181 flow [2021-06-05 03:11:55,344 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 137780 states, 137759 states have (on average 6.5724852822683095) internal successors, (905419), 137779 states have internal predecessors, (905419), 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) [2021-06-05 03:11:55,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 137780 states, 137759 states have (on average 6.5724852822683095) internal successors, (905419), 137779 states have internal predecessors, (905419), 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) [2021-06-05 03:11:55,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-06-05 03:11:55,559 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:11:55,559 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-06-05 03:11:55,559 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:11:55,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:11:55,559 INFO L82 PathProgramCache]: Analyzing trace with hash 6819, now seen corresponding path program 1 times [2021-06-05 03:11:55,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:11:55,560 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750096411] [2021-06-05 03:11:55,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:11:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:11:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:11:55,569 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:11:55,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750096411] [2021-06-05 03:11:55,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750096411] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:11:55,570 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:11:55,570 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 03:11:55,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416326686] [2021-06-05 03:11:55,570 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:11:55,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:11:55,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:11:55,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:11:55,777 INFO L87 Difference]: Start difference. First operand has 137780 states, 137759 states have (on average 6.5724852822683095) internal successors, (905419), 137779 states have internal predecessors, (905419), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:11:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:11:57,514 INFO L93 Difference]: Finished difference Result 108256 states and 708589 transitions. [2021-06-05 03:11:57,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:11:57,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-06-05 03:11:57,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:11:58,240 INFO L225 Difference]: With dead ends: 108256 [2021-06-05 03:11:58,240 INFO L226 Difference]: Without dead ends: 49208 [2021-06-05 03:11:58,242 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:12:06,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49208 states. [2021-06-05 03:12:08,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49208 to 49208. [2021-06-05 03:12:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49208 states, 49207 states have (on average 6.400085353709838) internal successors, (314929), 49207 states have internal predecessors, (314929), 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) [2021-06-05 03:12:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49208 states to 49208 states and 314929 transitions. [2021-06-05 03:12:08,842 INFO L78 Accepts]: Start accepts. Automaton has 49208 states and 314929 transitions. Word has length 2 [2021-06-05 03:12:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:12:08,842 INFO L482 AbstractCegarLoop]: Abstraction has 49208 states and 314929 transitions. [2021-06-05 03:12:08,842 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-06-05 03:12:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 49208 states and 314929 transitions. [2021-06-05 03:12:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-06-05 03:12:08,847 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:12:08,847 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:12:08,848 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 03:12:08,848 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:12:08,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:12:08,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1814808561, now seen corresponding path program 1 times [2021-06-05 03:12:08,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:12:08,849 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775572717] [2021-06-05 03:12:08,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:12:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:12:08,853 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:12:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:12:08,855 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:12:08,856 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:12:08,857 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:12:08,857 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 03:12:08,857 WARN L242 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:12:08,857 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2021-06-05 03:12:08,873 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:12:08,874 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:12:08,875 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:12:08,875 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:12:08,875 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:12:08,875 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:12:08,875 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:12:08,875 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:12:08,875 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:12:08,875 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:12:08,876 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 35 transitions, 210 flow Received shutdown request... [2021-06-05 03:24:16,696 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 03:24:16,697 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 10 thread instances [2021-06-05 03:24:16,701 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 03:24:16,701 INFO L202 PluginConnector]: Adding new model fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 03:24:16 BasicIcfg [2021-06-05 03:24:16,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 03:24:16,702 INFO L168 Benchmark]: Toolchain (without parser) took 870077.73 ms. Allocated memory was 348.1 MB in the beginning and 8.8 GB in the end (delta: 8.5 GB). Free memory was 328.4 MB in the beginning and 3.5 GB in the end (delta: -3.1 GB). Peak memory consumption was 5.4 GB. Max. memory is 16.0 GB. [2021-06-05 03:24:16,703 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 348.1 MB. Free memory was 329.4 MB in the beginning and 329.3 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 03:24:16,703 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.97 ms. Allocated memory is still 348.1 MB. Free memory was 328.3 MB in the beginning and 326.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 03:24:16,704 INFO L168 Benchmark]: Boogie Preprocessor took 11.87 ms. Allocated memory is still 348.1 MB. Free memory was 326.8 MB in the beginning and 325.9 MB in the end (delta: 882.9 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 03:24:16,704 INFO L168 Benchmark]: RCFGBuilder took 154.02 ms. Allocated memory is still 348.1 MB. Free memory was 325.9 MB in the beginning and 317.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.0 GB. [2021-06-05 03:24:16,704 INFO L168 Benchmark]: TraceAbstraction took 869883.37 ms. Allocated memory was 348.1 MB in the beginning and 8.8 GB in the end (delta: 8.5 GB). Free memory was 317.3 MB in the beginning and 3.5 GB in the end (delta: -3.1 GB). Peak memory consumption was 5.4 GB. Max. memory is 16.0 GB. [2021-06-05 03:24:16,706 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.18 ms. Allocated memory is still 348.1 MB. Free memory was 329.4 MB in the beginning and 329.3 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 23.97 ms. Allocated memory is still 348.1 MB. Free memory was 328.3 MB in the beginning and 326.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 11.87 ms. Allocated memory is still 348.1 MB. Free memory was 326.8 MB in the beginning and 325.9 MB in the end (delta: 882.9 kB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 154.02 ms. Allocated memory is still 348.1 MB. Free memory was 325.9 MB in the beginning and 317.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 869883.37 ms. Allocated memory was 348.1 MB in the beginning and 8.8 GB in the end (delta: 8.5 GB). Free memory was 317.3 MB in the beginning and 3.5 GB in the end (delta: -3.1 GB). Peak memory consumption was 5.4 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 56 places, 35 transitions, 210 flow. Already constructed 365675 states. Currently 36383 states in worklist.. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 56 places, 35 transitions, 210 flow. Already constructed 365675 states. Currently 36383 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 12 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 224.3ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 6.3ms, AutomataDifference: 32.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6 SDtfs, 6 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 11.5ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 3.3ms SsaConstructionTime, 12.4ms SatisfiabilityAnalysisTime, 43.4ms InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 15 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 43.2ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 1.0ms, AutomataDifference: 8.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 9 SDtfs, 9 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 4.2ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8ms SsaConstructionTime, 2.2ms SatisfiabilityAnalysisTime, 6.2ms InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 18 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 151.4ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 2.0ms, AutomataDifference: 32.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 31.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 12 SDtfs, 12 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 23.2ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2ms SsaConstructionTime, 15.5ms SatisfiabilityAnalysisTime, 19.4ms InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 21 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 135.4ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 3.2ms, AutomataDifference: 31.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 47.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 15 SDtfs, 15 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=566occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 27.0ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9ms SsaConstructionTime, 2.7ms SatisfiabilityAnalysisTime, 6.2ms InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 5 thread instances CFG has 7 procedures, 24 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 211.9ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 6.1ms, AutomataDifference: 36.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 93.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 18 SDtfs, 18 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1700occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 50.2ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9ms SsaConstructionTime, 2.9ms SatisfiabilityAnalysisTime, 6.0ms InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 6 thread instances CFG has 8 procedures, 27 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 853.2ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 21.5ms, AutomataDifference: 112.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 491.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 21 SDtfs, 21 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5102occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 158.4ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 3.3ms SsaConstructionTime, 12.3ms SatisfiabilityAnalysisTime, 22.4ms InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 7 thread instances CFG has 9 procedures, 30 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2425.5ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 36.7ms, AutomataDifference: 267.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1447.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 24 SDtfs, 24 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=15308occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 568.4ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.5ms SsaConstructionTime, 12.7ms SatisfiabilityAnalysisTime, 14.5ms InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 8 thread instances CFG has 10 procedures, 33 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16210.5ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 76.8ms, AutomataDifference: 900.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13362.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 27 SDtfs, 27 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=45926occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1842.4ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6ms SsaConstructionTime, 2.5ms SatisfiabilityAnalysisTime, 4.6ms InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 9 thread instances CFG has 11 procedures, 36 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 121591.0ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 195.4ms, AutomataDifference: 2670.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 108101.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 30 SDtfs, 30 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=137780occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 10599.8ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0ms SsaConstructionTime, 2.3ms SatisfiabilityAnalysisTime, 6.8ms InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 10 thread instances CFG has 12 procedures, 39 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 727822.1ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 727821.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown