/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/bigNumberOfThreads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 03:09:37,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 03:09:37,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 03:09:37,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 03:09:37,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 03:09:37,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 03:09:37,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 03:09:37,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 03:09:37,851 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 03:09:37,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 03:09:37,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 03:09:37,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 03:09:37,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 03:09:37,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 03:09:37,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 03:09:37,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 03:09:37,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 03:09:37,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 03:09:37,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 03:09:37,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 03:09:37,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 03:09:37,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 03:09:37,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 03:09:37,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 03:09:37,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 03:09:37,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 03:09:37,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 03:09:37,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 03:09:37,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 03:09:37,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 03:09:37,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 03:09:37,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 03:09:37,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 03:09:37,887 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 03:09:37,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 03:09:37,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 03:09:37,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 03:09:37,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 03:09:37,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 03:09:37,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 03:09:37,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 03:09:37,894 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:37,929 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 03:09:37,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 03:09:37,930 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 03:09:37,930 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 03:09:37,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 03:09:37,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 03:09:37,932 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 03:09:37,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 03:09:37,933 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 03:09:37,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 03:09:37,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 03:09:37,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 03:09:37,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 03:09:37,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 03:09:37,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 03:09:37,935 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 03:09:37,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 03:09:37,935 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 03:09:37,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 03:09:37,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 03:09:37,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 03:09:37,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 03:09:37,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 03:09:37,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 03:09:37,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 03:09:37,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 03:09:37,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 03:09:37,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 03:09:37,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 03:09:37,937 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 03:09:37,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 03:09:37,937 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:38,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 03:09:38,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 03:09:38,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 03:09:38,280 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 03:09:38,282 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 03:09:38,282 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/bigNumberOfThreads.bpl [2021-06-05 03:09:38,294 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/bigNumberOfThreads.bpl' [2021-06-05 03:09:38,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 03:09:38,317 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 03:09:38,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 03:09:38,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 03:09:38,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 03:09:38,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 03:09:38,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 03:09:38,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 03:09:38,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 03:09:38,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/1) ... [2021-06-05 03:09:38,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 03:09:38,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 03:09:38,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 03:09:38,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 03:09:38,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (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:38,440 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 03:09:38,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 03:09:38,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 03:09:38,441 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2021-06-05 03:09:38,441 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2021-06-05 03:09:38,441 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2021-06-05 03:09:38,442 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:38,565 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 03:09:38,565 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-06-05 03:09:38,566 INFO L202 PluginConnector]: Adding new model bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 03:09:38 BoogieIcfgContainer [2021-06-05 03:09:38,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 03:09:38,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 03:09:38,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 03:09:38,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 03:09:38,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 03:09:38" (1/2) ... [2021-06-05 03:09:38,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e06ec14 and model type bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 03:09:38, skipping insertion in model container [2021-06-05 03:09:38,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 03:09:38" (2/2) ... [2021-06-05 03:09:38,572 INFO L111 eAbstractionObserver]: Analyzing ICFG bigNumberOfThreads.bpl [2021-06-05 03:09:38,577 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 03:09:38,577 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 03:09:38,577 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 03:09:38,578 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 03:09:38,597 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:38,615 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:38,632 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:38,632 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:38,633 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:38,633 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:38,633 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:38,633 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:38,633 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:38,633 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:38,640 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions, 29 flow [2021-06-05 03:09:38,649 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 32 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 31 states have internal predecessors, (45), 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:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 31 states have internal predecessors, (45), 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:38,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-06-05 03:09:38,655 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:38,656 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-06-05 03:09:38,656 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:38,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:38,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1386462, now seen corresponding path program 1 times [2021-06-05 03:09:38,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:38,667 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164773665] [2021-06-05 03:09:38,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:38,779 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:38,779 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:38,779 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164773665] [2021-06-05 03:09:38,780 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164773665] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:38,780 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:38,780 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 03:09:38,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209715763] [2021-06-05 03:09:38,784 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:38,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:38,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:38,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:38,798 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 31 states have internal predecessors, (45), 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, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:38,839 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. [2021-06-05 03:09:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:38,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2021-06-05 03:09:38,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:38,847 INFO L225 Difference]: With dead ends: 28 [2021-06-05 03:09:38,848 INFO L226 Difference]: Without dead ends: 22 [2021-06-05 03:09:38,849 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:38,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-06-05 03:09:38,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-06-05 03:09:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 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:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2021-06-05 03:09:38,882 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 4 [2021-06-05 03:09:38,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:38,884 INFO L482 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-06-05 03:09:38,884 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:38,884 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2021-06-05 03:09:38,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-06-05 03:09:38,885 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:38,885 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2021-06-05 03:09:38,885 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 03:09:38,885 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:38,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:38,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1646156556, now seen corresponding path program 1 times [2021-06-05 03:09:38,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:38,889 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639265665] [2021-06-05 03:09:38,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:38,902 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:38,911 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:38,923 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:38,924 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:38,924 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 03:09:38,925 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:38,925 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 03:09:38,958 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:38,958 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:38,959 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:38,960 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:38,960 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:38,960 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:38,960 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:38,960 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:38,960 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:38,960 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:38,961 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 15 transitions, 42 flow [2021-06-05 03:09:38,968 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 101 states, 94 states have (on average 2.148936170212766) internal successors, (202), 100 states have internal predecessors, (202), 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:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 94 states have (on average 2.148936170212766) internal successors, (202), 100 states have internal predecessors, (202), 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:38,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-06-05 03:09:38,982 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:38,982 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-06-05 03:09:38,982 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:38,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:38,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1848222, now seen corresponding path program 1 times [2021-06-05 03:09:38,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:38,983 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422137611] [2021-06-05 03:09:38,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:39,021 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:39,021 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:39,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422137611] [2021-06-05 03:09:39,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422137611] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:39,022 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:39,022 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 03:09:39,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361924892] [2021-06-05 03:09:39,022 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:39,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:39,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:39,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:39,024 INFO L87 Difference]: Start difference. First operand has 101 states, 94 states have (on average 2.148936170212766) internal successors, (202), 100 states have internal predecessors, (202), 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, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:39,041 INFO L93 Difference]: Finished difference Result 97 states and 198 transitions. [2021-06-05 03:09:39,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:39,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2021-06-05 03:09:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:39,051 INFO L225 Difference]: With dead ends: 97 [2021-06-05 03:09:39,051 INFO L226 Difference]: Without dead ends: 73 [2021-06-05 03:09:39,051 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-06-05 03:09:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-06-05 03:09:39,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 70 states have (on average 2.085714285714286) internal successors, (146), 72 states have internal predecessors, (146), 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:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 146 transitions. [2021-06-05 03:09:39,077 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 146 transitions. Word has length 4 [2021-06-05 03:09:39,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:39,077 INFO L482 AbstractCegarLoop]: Abstraction has 73 states and 146 transitions. [2021-06-05 03:09:39,077 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:39,077 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 146 transitions. [2021-06-05 03:09:39,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-06-05 03:09:39,078 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:39,078 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:39,078 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 03:09:39,078 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:39,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:39,079 INFO L82 PathProgramCache]: Analyzing trace with hash -774691786, now seen corresponding path program 1 times [2021-06-05 03:09:39,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:39,079 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338311495] [2021-06-05 03:09:39,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:39,119 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:39,119 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338311495] [2021-06-05 03:09:39,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338311495] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:39,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523724312] [2021-06-05 03:09:39,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:09:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:39,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-05 03:09:39,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 03:09:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:39,216 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523724312] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:39,216 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 03:09:39,216 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-06-05 03:09:39,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237196232] [2021-06-05 03:09:39,216 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 03:09:39,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:39,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 03:09:39,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 03:09:39,218 INFO L87 Difference]: Start difference. First operand 73 states and 146 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:09:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:39,238 INFO L93 Difference]: Finished difference Result 67 states and 136 transitions. [2021-06-05 03:09:39,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 03:09:39,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-06-05 03:09:39,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:39,240 INFO L225 Difference]: With dead ends: 67 [2021-06-05 03:09:39,240 INFO L226 Difference]: Without dead ends: 67 [2021-06-05 03:09:39,240 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 03:09:39,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-06-05 03:09:39,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-06-05 03:09:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 2.0923076923076924) internal successors, (136), 66 states have internal predecessors, (136), 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:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 136 transitions. [2021-06-05 03:09:39,251 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 136 transitions. Word has length 7 [2021-06-05 03:09:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:39,252 INFO L482 AbstractCegarLoop]: Abstraction has 67 states and 136 transitions. [2021-06-05 03:09:39,252 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:09:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 136 transitions. [2021-06-05 03:09:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-06-05 03:09:39,253 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:39,253 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2021-06-05 03:09:39,454 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:09:39,454 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:39,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:39,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1984184086, now seen corresponding path program 1 times [2021-06-05 03:09:39,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:39,455 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833707201] [2021-06-05 03:09:39,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:39,462 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:39,470 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:39,472 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:39,472 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:39,472 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 03:09:39,472 WARN L242 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:39,472 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2021-06-05 03:09:39,483 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:39,483 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:39,485 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:39,485 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:39,485 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:39,485 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:39,486 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:39,486 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:39,486 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:39,486 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:39,488 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 57 flow [2021-06-05 03:09:39,523 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 308 states, 299 states have (on average 2.7123745819397995) internal successors, (811), 307 states have internal predecessors, (811), 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:39,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 308 states, 299 states have (on average 2.7123745819397995) internal successors, (811), 307 states have internal predecessors, (811), 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:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-06-05 03:09:39,525 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:39,525 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-06-05 03:09:39,526 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:39,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:39,526 INFO L82 PathProgramCache]: Analyzing trace with hash 2402334, now seen corresponding path program 1 times [2021-06-05 03:09:39,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:39,527 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848475216] [2021-06-05 03:09:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:39,547 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:39,548 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:39,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848475216] [2021-06-05 03:09:39,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848475216] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:39,548 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:39,548 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 03:09:39,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259601270] [2021-06-05 03:09:39,549 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:39,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:39,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:39,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:39,551 INFO L87 Difference]: Start difference. First operand has 308 states, 299 states have (on average 2.7123745819397995) internal successors, (811), 307 states have internal predecessors, (811), 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, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:39,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:39,571 INFO L93 Difference]: Finished difference Result 304 states and 807 transitions. [2021-06-05 03:09:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:39,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2021-06-05 03:09:39,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:39,576 INFO L225 Difference]: With dead ends: 304 [2021-06-05 03:09:39,577 INFO L226 Difference]: Without dead ends: 226 [2021-06-05 03:09:39,577 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:39,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-06-05 03:09:39,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2021-06-05 03:09:39,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 222 states have (on average 2.671171171171171) internal successors, (593), 225 states have internal predecessors, (593), 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:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 593 transitions. [2021-06-05 03:09:39,604 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 593 transitions. Word has length 4 [2021-06-05 03:09:39,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:39,604 INFO L482 AbstractCegarLoop]: Abstraction has 226 states and 593 transitions. [2021-06-05 03:09:39,604 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 593 transitions. [2021-06-05 03:09:39,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-06-05 03:09:39,605 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:39,605 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:39,605 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 03:09:39,605 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:39,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:39,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1446932922, now seen corresponding path program 1 times [2021-06-05 03:09:39,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:39,606 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363726135] [2021-06-05 03:09:39,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:39,633 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:39,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363726135] [2021-06-05 03:09:39,633 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363726135] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:39,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475894201] [2021-06-05 03:09:39,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:09:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:39,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-05 03:09:39,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 03:09:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:39,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475894201] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:39,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 03:09:39,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-06-05 03:09:39,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867303523] [2021-06-05 03:09:39,707 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 03:09:39,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:39,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 03:09:39,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 03:09:39,707 INFO L87 Difference]: Start difference. First operand 226 states and 593 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:09:39,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:39,725 INFO L93 Difference]: Finished difference Result 220 states and 583 transitions. [2021-06-05 03:09:39,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 03:09:39,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-06-05 03:09:39,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:39,734 INFO L225 Difference]: With dead ends: 220 [2021-06-05 03:09:39,734 INFO L226 Difference]: Without dead ends: 220 [2021-06-05 03:09:39,734 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 03:09:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-06-05 03:09:39,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2021-06-05 03:09:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 217 states have (on average 2.686635944700461) internal successors, (583), 219 states have internal predecessors, (583), 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:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 583 transitions. [2021-06-05 03:09:39,756 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 583 transitions. Word has length 7 [2021-06-05 03:09:39,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:39,756 INFO L482 AbstractCegarLoop]: Abstraction has 220 states and 583 transitions. [2021-06-05 03:09:39,756 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:09:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 583 transitions. [2021-06-05 03:09:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-06-05 03:09:39,757 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:39,757 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:39,977 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:09:39,978 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:39,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:39,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1287287939, now seen corresponding path program 1 times [2021-06-05 03:09:39,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:39,979 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437918909] [2021-06-05 03:09:39,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:40,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:40,013 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:40,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437918909] [2021-06-05 03:09:40,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437918909] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:40,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661272144] [2021-06-05 03:09:40,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:09:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:40,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 03:09:40,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 03:09:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:40,072 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661272144] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:40,072 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 03:09:40,072 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-06-05 03:09:40,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326405929] [2021-06-05 03:09:40,073 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 03:09:40,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:40,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 03:09:40,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-05 03:09:40,074 INFO L87 Difference]: Start difference. First operand 220 states and 583 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:40,101 INFO L93 Difference]: Finished difference Result 202 states and 541 transitions. [2021-06-05 03:09:40,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 03:09:40,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2021-06-05 03:09:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:40,121 INFO L225 Difference]: With dead ends: 202 [2021-06-05 03:09:40,121 INFO L226 Difference]: Without dead ends: 202 [2021-06-05 03:09:40,122 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-05 03:09:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-06-05 03:09:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-06-05 03:09:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 200 states have (on average 2.705) internal successors, (541), 201 states have internal predecessors, (541), 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:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 541 transitions. [2021-06-05 03:09:40,152 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 541 transitions. Word has length 10 [2021-06-05 03:09:40,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:40,152 INFO L482 AbstractCegarLoop]: Abstraction has 202 states and 541 transitions. [2021-06-05 03:09:40,152 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 541 transitions. [2021-06-05 03:09:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-06-05 03:09:40,153 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:40,153 INFO L521 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:40,368 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:09:40,368 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:40,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash 167633716, now seen corresponding path program 1 times [2021-06-05 03:09:40,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:40,369 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734304280] [2021-06-05 03:09:40,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:40,375 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:40,381 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:40,383 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:40,383 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:40,383 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 03:09:40,384 WARN L242 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:40,384 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2021-06-05 03:09:40,390 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:40,391 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:40,396 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:40,396 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:40,396 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:40,396 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:40,396 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:40,396 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:40,396 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:40,396 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:40,397 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 21 transitions, 74 flow [2021-06-05 03:09:40,426 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 929 states, 918 states have (on average 3.3246187363834423) internal successors, (3052), 928 states have internal predecessors, (3052), 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:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 929 states, 918 states have (on average 3.3246187363834423) internal successors, (3052), 928 states have internal predecessors, (3052), 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:40,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-06-05 03:09:40,428 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:40,428 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-06-05 03:09:40,429 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:40,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:40,429 INFO L82 PathProgramCache]: Analyzing trace with hash 3048798, now seen corresponding path program 1 times [2021-06-05 03:09:40,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:40,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010072486] [2021-06-05 03:09:40,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:40,458 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:40,458 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:40,458 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010072486] [2021-06-05 03:09:40,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010072486] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:40,458 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:40,458 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 03:09:40,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821425910] [2021-06-05 03:09:40,459 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:40,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:40,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:40,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:40,462 INFO L87 Difference]: Start difference. First operand has 929 states, 918 states have (on average 3.3246187363834423) internal successors, (3052), 928 states have internal predecessors, (3052), 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, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:40,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:40,481 INFO L93 Difference]: Finished difference Result 925 states and 3048 transitions. [2021-06-05 03:09:40,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:40,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2021-06-05 03:09:40,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:40,487 INFO L225 Difference]: With dead ends: 925 [2021-06-05 03:09:40,487 INFO L226 Difference]: Without dead ends: 685 [2021-06-05 03:09:40,487 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:40,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-06-05 03:09:40,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2021-06-05 03:09:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 680 states have (on average 3.2941176470588234) internal successors, (2240), 684 states have internal predecessors, (2240), 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:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 2240 transitions. [2021-06-05 03:09:40,523 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 2240 transitions. Word has length 4 [2021-06-05 03:09:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:40,524 INFO L482 AbstractCegarLoop]: Abstraction has 685 states and 2240 transitions. [2021-06-05 03:09:40,524 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 2240 transitions. [2021-06-05 03:09:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-06-05 03:09:40,524 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:40,524 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:40,525 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 03:09:40,525 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:40,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:40,525 INFO L82 PathProgramCache]: Analyzing trace with hash 632087353, now seen corresponding path program 1 times [2021-06-05 03:09:40,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:40,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368292691] [2021-06-05 03:09:40,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:40,553 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:40,553 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368292691] [2021-06-05 03:09:40,553 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368292691] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:40,553 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866858013] [2021-06-05 03:09:40,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:09:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:40,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-05 03:09:40,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 03:09:40,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:40,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866858013] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:40,638 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 03:09:40,639 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-06-05 03:09:40,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583897545] [2021-06-05 03:09:40,639 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 03:09:40,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:40,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 03:09:40,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 03:09:40,640 INFO L87 Difference]: Start difference. First operand 685 states and 2240 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:09:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:40,667 INFO L93 Difference]: Finished difference Result 679 states and 2230 transitions. [2021-06-05 03:09:40,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 03:09:40,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-06-05 03:09:40,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:40,673 INFO L225 Difference]: With dead ends: 679 [2021-06-05 03:09:40,673 INFO L226 Difference]: Without dead ends: 679 [2021-06-05 03:09:40,673 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 03:09:40,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2021-06-05 03:09:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2021-06-05 03:09:40,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 675 states have (on average 3.303703703703704) internal successors, (2230), 678 states have internal predecessors, (2230), 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:40,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 2230 transitions. [2021-06-05 03:09:40,697 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 2230 transitions. Word has length 7 [2021-06-05 03:09:40,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:40,697 INFO L482 AbstractCegarLoop]: Abstraction has 679 states and 2230 transitions. [2021-06-05 03:09:40,697 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:09:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 2230 transitions. [2021-06-05 03:09:40,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-06-05 03:09:40,698 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:40,698 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:40,921 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:09:40,922 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:40,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:40,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1377396701, now seen corresponding path program 1 times [2021-06-05 03:09:40,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:40,922 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463905377] [2021-06-05 03:09:40,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:40,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:40,942 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:40,943 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463905377] [2021-06-05 03:09:40,943 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463905377] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:40,943 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078992075] [2021-06-05 03:09:40,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:09:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:40,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 03:09:40,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 03:09:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:40,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078992075] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:40,996 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 03:09:40,996 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-06-05 03:09:40,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796118747] [2021-06-05 03:09:40,997 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 03:09:40,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:40,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 03:09:40,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-05 03:09:40,997 INFO L87 Difference]: Start difference. First operand 679 states and 2230 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:41,038 INFO L93 Difference]: Finished difference Result 661 states and 2188 transitions. [2021-06-05 03:09:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 03:09:41,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2021-06-05 03:09:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:41,045 INFO L225 Difference]: With dead ends: 661 [2021-06-05 03:09:41,045 INFO L226 Difference]: Without dead ends: 661 [2021-06-05 03:09:41,045 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-05 03:09:41,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2021-06-05 03:09:41,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2021-06-05 03:09:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 658 states have (on average 3.325227963525836) internal successors, (2188), 660 states have internal predecessors, (2188), 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:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 2188 transitions. [2021-06-05 03:09:41,067 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 2188 transitions. Word has length 10 [2021-06-05 03:09:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:41,067 INFO L482 AbstractCegarLoop]: Abstraction has 661 states and 2188 transitions. [2021-06-05 03:09:41,067 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 2188 transitions. [2021-06-05 03:09:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-06-05 03:09:41,068 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:41,068 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:41,291 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-06-05 03:09:41,292 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:41,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:41,292 INFO L82 PathProgramCache]: Analyzing trace with hash -92707560, now seen corresponding path program 1 times [2021-06-05 03:09:41,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:41,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614986512] [2021-06-05 03:09:41,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:41,333 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:41,333 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614986512] [2021-06-05 03:09:41,333 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614986512] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:41,333 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885348808] [2021-06-05 03:09:41,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:09:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:41,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-05 03:09:41,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 03:09:41,391 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:41,391 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885348808] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:41,391 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 03:09:41,391 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-06-05 03:09:41,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520983340] [2021-06-05 03:09:41,391 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 03:09:41,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:41,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 03:09:41,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-06-05 03:09:41,392 INFO L87 Difference]: Start difference. First operand 661 states and 2188 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:41,432 INFO L93 Difference]: Finished difference Result 607 states and 2026 transitions. [2021-06-05 03:09:41,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 03:09:41,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2021-06-05 03:09:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:41,436 INFO L225 Difference]: With dead ends: 607 [2021-06-05 03:09:41,436 INFO L226 Difference]: Without dead ends: 607 [2021-06-05 03:09:41,437 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-06-05 03:09:41,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2021-06-05 03:09:41,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2021-06-05 03:09:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 605 states have (on average 3.3487603305785125) internal successors, (2026), 606 states have internal predecessors, (2026), 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:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 2026 transitions. [2021-06-05 03:09:41,465 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 2026 transitions. Word has length 13 [2021-06-05 03:09:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:41,466 INFO L482 AbstractCegarLoop]: Abstraction has 607 states and 2026 transitions. [2021-06-05 03:09:41,467 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 2026 transitions. [2021-06-05 03:09:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 03:09:41,468 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:41,468 INFO L521 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:41,685 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:09:41,685 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:41,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:41,686 INFO L82 PathProgramCache]: Analyzing trace with hash -187199923, now seen corresponding path program 1 times [2021-06-05 03:09:41,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:41,686 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797286929] [2021-06-05 03:09:41,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:41,693 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:41,697 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:41,699 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:41,700 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:41,700 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 03:09:41,700 WARN L242 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 03:09:41,700 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2021-06-05 03:09:41,709 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 03:09:41,709 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 03:09:41,710 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:09:41,710 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:09:41,710 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:09:41,710 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:09:41,711 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:09:41,711 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:09:41,711 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:09:41,711 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:09:41,712 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 24 transitions, 93 flow [2021-06-05 03:09:41,854 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2792 states, 2779 states have (on average 3.9643756747031307) internal successors, (11017), 2791 states have internal predecessors, (11017), 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:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 2792 states, 2779 states have (on average 3.9643756747031307) internal successors, (11017), 2791 states have internal predecessors, (11017), 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:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-06-05 03:09:41,861 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:41,861 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-06-05 03:09:41,862 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:41,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:41,862 INFO L82 PathProgramCache]: Analyzing trace with hash 3787614, now seen corresponding path program 1 times [2021-06-05 03:09:41,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:41,862 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490805287] [2021-06-05 03:09:41,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:41,882 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:41,882 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:41,882 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490805287] [2021-06-05 03:09:41,882 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490805287] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:41,882 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:41,882 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 03:09:41,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755962454] [2021-06-05 03:09:41,882 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 03:09:41,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:41,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 03:09:41,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:41,897 INFO L87 Difference]: Start difference. First operand has 2792 states, 2779 states have (on average 3.9643756747031307) internal successors, (11017), 2791 states have internal predecessors, (11017), 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, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:41,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:41,931 INFO L93 Difference]: Finished difference Result 2788 states and 11013 transitions. [2021-06-05 03:09:41,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 03:09:41,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2021-06-05 03:09:41,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:41,946 INFO L225 Difference]: With dead ends: 2788 [2021-06-05 03:09:41,946 INFO L226 Difference]: Without dead ends: 2062 [2021-06-05 03:09:41,946 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 03:09:41,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2021-06-05 03:09:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 2062. [2021-06-05 03:09:42,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2062 states, 2056 states have (on average 3.9392023346303504) internal successors, (8099), 2061 states have internal predecessors, (8099), 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:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 8099 transitions. [2021-06-05 03:09:42,036 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 8099 transitions. Word has length 4 [2021-06-05 03:09:42,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:42,036 INFO L482 AbstractCegarLoop]: Abstraction has 2062 states and 8099 transitions. [2021-06-05 03:09:42,037 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:42,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 8099 transitions. [2021-06-05 03:09:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-06-05 03:09:42,037 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:42,038 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:42,038 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 03:09:42,038 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:42,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:42,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1167401743, now seen corresponding path program 1 times [2021-06-05 03:09:42,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:42,039 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966776519] [2021-06-05 03:09:42,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:42,076 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:42,076 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966776519] [2021-06-05 03:09:42,076 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966776519] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:42,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344135886] [2021-06-05 03:09:42,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:09:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:42,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-05 03:09:42,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 03:09:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:42,133 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344135886] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:42,134 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 03:09:42,134 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-06-05 03:09:42,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735252791] [2021-06-05 03:09:42,135 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 03:09:42,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:42,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 03:09:42,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 03:09:42,135 INFO L87 Difference]: Start difference. First operand 2062 states and 8099 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:09:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:42,168 INFO L93 Difference]: Finished difference Result 2056 states and 8089 transitions. [2021-06-05 03:09:42,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 03:09:42,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-06-05 03:09:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:42,182 INFO L225 Difference]: With dead ends: 2056 [2021-06-05 03:09:42,182 INFO L226 Difference]: Without dead ends: 2056 [2021-06-05 03:09:42,182 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 03:09:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2021-06-05 03:09:42,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 2056. [2021-06-05 03:09:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2056 states, 2051 states have (on average 3.9439297903461727) internal successors, (8089), 2055 states have internal predecessors, (8089), 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:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 8089 transitions. [2021-06-05 03:09:42,258 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 8089 transitions. Word has length 7 [2021-06-05 03:09:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:42,258 INFO L482 AbstractCegarLoop]: Abstraction has 2056 states and 8089 transitions. [2021-06-05 03:09:42,258 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:09:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 8089 transitions. [2021-06-05 03:09:42,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-06-05 03:09:42,261 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:42,261 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:42,485 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-06-05 03:09:42,485 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:42,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:42,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1714902557, now seen corresponding path program 1 times [2021-06-05 03:09:42,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:42,486 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032232520] [2021-06-05 03:09:42,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:42,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:42,512 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:42,512 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032232520] [2021-06-05 03:09:42,513 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032232520] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:42,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630684263] [2021-06-05 03:09:42,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:09:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:42,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 03:09:42,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 03:09:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:42,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630684263] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:42,582 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 03:09:42,583 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-06-05 03:09:42,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211062951] [2021-06-05 03:09:42,583 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 03:09:42,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:42,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 03:09:42,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-05 03:09:42,584 INFO L87 Difference]: Start difference. First operand 2056 states and 8089 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:42,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:42,615 INFO L93 Difference]: Finished difference Result 2038 states and 8047 transitions. [2021-06-05 03:09:42,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 03:09:42,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2021-06-05 03:09:42,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:42,629 INFO L225 Difference]: With dead ends: 2038 [2021-06-05 03:09:42,629 INFO L226 Difference]: Without dead ends: 2038 [2021-06-05 03:09:42,629 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-05 03:09:42,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2021-06-05 03:09:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 2038. [2021-06-05 03:09:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2038 states, 2034 states have (on average 3.956243854473943) internal successors, (8047), 2037 states have internal predecessors, (8047), 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:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 8047 transitions. [2021-06-05 03:09:42,703 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 8047 transitions. Word has length 10 [2021-06-05 03:09:42,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:42,703 INFO L482 AbstractCegarLoop]: Abstraction has 2038 states and 8047 transitions. [2021-06-05 03:09:42,704 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:42,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 8047 transitions. [2021-06-05 03:09:42,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-06-05 03:09:42,704 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:42,704 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:42,928 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-06-05 03:09:42,928 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:42,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:42,928 INFO L82 PathProgramCache]: Analyzing trace with hash 25892014, now seen corresponding path program 1 times [2021-06-05 03:09:42,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:42,929 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42130614] [2021-06-05 03:09:42,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:42,963 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:42,963 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42130614] [2021-06-05 03:09:42,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42130614] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:42,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583364080] [2021-06-05 03:09:42,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:09:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:43,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-05 03:09:43,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 03:09:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:43,062 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583364080] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:43,062 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 03:09:43,062 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-06-05 03:09:43,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306860743] [2021-06-05 03:09:43,063 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 03:09:43,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:43,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 03:09:43,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-06-05 03:09:43,063 INFO L87 Difference]: Start difference. First operand 2038 states and 8047 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:43,101 INFO L93 Difference]: Finished difference Result 1984 states and 7885 transitions. [2021-06-05 03:09:43,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 03:09:43,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2021-06-05 03:09:43,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:43,165 INFO L225 Difference]: With dead ends: 1984 [2021-06-05 03:09:43,165 INFO L226 Difference]: Without dead ends: 1984 [2021-06-05 03:09:43,166 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-06-05 03:09:43,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2021-06-05 03:09:43,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1984. [2021-06-05 03:09:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1984 states, 1981 states have (on average 3.9803129732458356) internal successors, (7885), 1983 states have internal predecessors, (7885), 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:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 7885 transitions. [2021-06-05 03:09:43,242 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 7885 transitions. Word has length 13 [2021-06-05 03:09:43,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:43,242 INFO L482 AbstractCegarLoop]: Abstraction has 1984 states and 7885 transitions. [2021-06-05 03:09:43,243 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 7885 transitions. [2021-06-05 03:09:43,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 03:09:43,244 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:43,244 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:43,457 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-06-05 03:09:43,457 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:43,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:43,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1745292068, now seen corresponding path program 1 times [2021-06-05 03:09:43,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:43,458 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007559467] [2021-06-05 03:09:43,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:43,509 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:43,509 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:43,509 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007559467] [2021-06-05 03:09:43,509 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007559467] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:43,509 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939000484] [2021-06-05 03:09:43,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:09:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:43,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 03:09:43,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 03:09:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:43,618 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939000484] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 03:09:43,618 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 03:09:43,618 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-06-05 03:09:43,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713480677] [2021-06-05 03:09:43,618 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 03:09:43,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:43,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 03:09:43,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-06-05 03:09:43,619 INFO L87 Difference]: Start difference. First operand 1984 states and 7885 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:43,660 INFO L93 Difference]: Finished difference Result 1822 states and 7291 transitions. [2021-06-05 03:09:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 03:09:43,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 16 [2021-06-05 03:09:43,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:43,688 INFO L225 Difference]: With dead ends: 1822 [2021-06-05 03:09:43,688 INFO L226 Difference]: Without dead ends: 1822 [2021-06-05 03:09:43,689 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.3ms TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-06-05 03:09:43,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2021-06-05 03:09:43,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1822. [2021-06-05 03:09:43,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1820 states have (on average 4.006043956043956) internal successors, (7291), 1821 states have internal predecessors, (7291), 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:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 7291 transitions. [2021-06-05 03:09:43,749 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 7291 transitions. Word has length 16 [2021-06-05 03:09:43,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:43,749 INFO L482 AbstractCegarLoop]: Abstraction has 1822 states and 7291 transitions. [2021-06-05 03:09:43,749 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 7291 transitions. [2021-06-05 03:09:43,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 03:09:43,751 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:43,751 INFO L521 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:43,967 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 03:09:43,968 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:43,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:43,968 INFO L82 PathProgramCache]: Analyzing trace with hash 877949504, now seen corresponding path program 1 times [2021-06-05 03:09:43,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:43,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685751055] [2021-06-05 03:09:43,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:09:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:09:44,021 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:09:44,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685751055] [2021-06-05 03:09:44,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685751055] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:09:44,021 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:09:44,021 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 03:09:44,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337152516] [2021-06-05 03:09:44,021 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 03:09:44,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:09:44,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 03:09:44,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-06-05 03:09:44,022 INFO L87 Difference]: Start difference. First operand 1822 states and 7291 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:09:44,062 INFO L93 Difference]: Finished difference Result 1336 states and 5185 transitions. [2021-06-05 03:09:44,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 03:09:44,063 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 19 [2021-06-05 03:09:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:09:44,068 INFO L225 Difference]: With dead ends: 1336 [2021-06-05 03:09:44,068 INFO L226 Difference]: Without dead ends: 1336 [2021-06-05 03:09:44,068 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.6ms TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-06-05 03:09:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2021-06-05 03:09:44,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2021-06-05 03:09:44,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1335 states have (on average 3.8838951310861423) internal successors, (5185), 1335 states have internal predecessors, (5185), 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:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 5185 transitions. [2021-06-05 03:09:44,108 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 5185 transitions. Word has length 19 [2021-06-05 03:09:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:09:44,109 INFO L482 AbstractCegarLoop]: Abstraction has 1336 states and 5185 transitions. [2021-06-05 03:09:44,109 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 5185 transitions. [2021-06-05 03:09:44,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 03:09:44,110 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:09:44,111 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:09:44,111 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 03:09:44,111 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:09:44,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:09:44,111 INFO L82 PathProgramCache]: Analyzing trace with hash 877949517, now seen corresponding path program 1 times [2021-06-05 03:09:44,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:09:44,111 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265822688] [2021-06-05 03:09:44,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:09:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:44,129 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 03:09:44,133 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 03:09:44,134 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 03:09:44,135 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 03:09:44,135 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 03:09:44,138 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 5 thread instances [2021-06-05 03:09:44,156 INFO L202 PluginConnector]: Adding new model bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 03:09:44 BasicIcfg [2021-06-05 03:09:44,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 03:09:44,157 INFO L168 Benchmark]: Toolchain (without parser) took 5839.45 ms. Allocated memory was 346.0 MB in the beginning and 419.4 MB in the end (delta: 73.4 MB). Free memory was 325.3 MB in the beginning and 246.6 MB in the end (delta: 78.7 MB). Peak memory consumption was 152.4 MB. Max. memory is 16.0 GB. [2021-06-05 03:09:44,157 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 346.0 MB. Free memory is still 326.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 03:09:44,157 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.21 ms. Allocated memory is still 346.0 MB. Free memory was 325.2 MB in the beginning and 323.8 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 03:09:44,157 INFO L168 Benchmark]: Boogie Preprocessor took 13.54 ms. Allocated memory is still 346.0 MB. Free memory was 323.8 MB in the beginning and 322.8 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 03:09:44,157 INFO L168 Benchmark]: RCFGBuilder took 208.60 ms. Allocated memory is still 346.0 MB. Free memory was 322.8 MB in the beginning and 314.3 MB in the end (delta: 8.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.0 GB. [2021-06-05 03:09:44,157 INFO L168 Benchmark]: TraceAbstraction took 5588.63 ms. Allocated memory was 346.0 MB in the beginning and 419.4 MB in the end (delta: 73.4 MB). Free memory was 313.9 MB in the beginning and 246.6 MB in the end (delta: 67.3 MB). Peak memory consumption was 142.0 MB. Max. memory is 16.0 GB. [2021-06-05 03:09:44,157 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.17 ms. Allocated memory is still 346.0 MB. Free memory is still 326.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 24.21 ms. Allocated memory is still 346.0 MB. Free memory was 325.2 MB in the beginning and 323.8 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 13.54 ms. Allocated memory is still 346.0 MB. Free memory was 323.8 MB in the beginning and 322.8 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 208.60 ms. Allocated memory is still 346.0 MB. Free memory was 322.8 MB in the beginning and 314.3 MB in the end (delta: 8.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 5588.63 ms. Allocated memory was 346.0 MB in the beginning and 419.4 MB in the end (delta: 73.4 MB). Free memory was 313.9 MB in the beginning and 246.6 MB in the end (delta: 67.3 MB). Peak memory consumption was 142.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: assertion can be violated assertion can be violated We found a FailurePath: [L26] 0 x := 0; VAL [x=0] [L27] 0 i := 0; VAL [i=0, x=0] [L29] COND TRUE 0 i < 5 VAL [i=0, x=0] [L30] FORK 0 fork i thread(); VAL [i=0, x=0] [L31] 0 i := i + 1; VAL [i=1, x=0] [L29] COND TRUE 0 i < 5 VAL [i=1, x=0] [L30] FORK 0 fork i thread(); VAL [i=1, x=0] [L31] 0 i := i + 1; VAL [i=2, x=0] [L29] COND TRUE 0 i < 5 VAL [i=2, x=0] [L30] FORK 0 fork i thread(); VAL [i=2, x=0] [L31] 0 i := i + 1; VAL [i=3, x=0] [L29] COND TRUE 0 i < 5 VAL [i=3, x=0] [L30] FORK 0 fork i thread(); VAL [i=3, x=0] [L31] 0 i := i + 1; VAL [i=4, x=0] [L29] COND TRUE 0 i < 5 VAL [i=4, x=0] [L30] FORK 0 fork i thread(); VAL [i=4, x=0] [L31] 0 i := i + 1; VAL [i=5, x=0] [L29] COND FALSE 0 !(i < 5) VAL [i=5, x=0] [L33] 0 assert x > 0; VAL [i=5, x=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 16 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 294.8ms, OverallIterations: 2, TraceHistogramMax: 2, EmptinessCheckTime: 6.4ms, AutomataDifference: 63.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 9 SDtfs, 4 SDslu, 7 SDs, 0 SdLazy, 6 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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: 22.2ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 4.2ms SsaConstructionTime, 20.1ms SatisfiabilityAnalysisTime, 37.6ms InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 5 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, 19 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 512.8ms, OverallIterations: 3, TraceHistogramMax: 3, EmptinessCheckTime: 2.2ms, AutomataDifference: 52.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 20.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 21 SDtfs, 14 SDslu, 23 SDs, 0 SdLazy, 18 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 36.4ms AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 4.8ms SsaConstructionTime, 12.0ms SatisfiabilityAnalysisTime, 129.7ms InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 33 SizeOfPredicates, 0 NumberOfNonLiveVariables, 13 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2 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, 22 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 898.5ms, OverallIterations: 4, TraceHistogramMax: 4, EmptinessCheckTime: 3.1ms, AutomataDifference: 103.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 37.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 38 SDtfs, 32 SDslu, 56 SDs, 0 SdLazy, 38 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 77.9ms AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 4.9ms SsaConstructionTime, 17.2ms SatisfiabilityAnalysisTime, 148.4ms InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 79 SizeOfPredicates, 0 NumberOfNonLiveVariables, 31 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/12 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, 25 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1304.2ms, OverallIterations: 5, TraceHistogramMax: 5, EmptinessCheckTime: 5.0ms, AutomataDifference: 155.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 29.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 60 SDtfs, 60 SDslu, 112 SDs, 0 SdLazy, 68 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=929occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 109.6ms AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 6.8ms SsaConstructionTime, 40.0ms SatisfiabilityAnalysisTime, 163.4ms InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 143 SizeOfPredicates, 0 NumberOfNonLiveVariables, 54 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/36 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, 28 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2424.6ms, OverallIterations: 7, TraceHistogramMax: 6, EmptinessCheckTime: 14.6ms, AutomataDifference: 377.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 143.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 130 SDtfs, 183 SDslu, 227 SDs, 0 SdLazy, 140 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 88.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 82.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2792occurred in iteration=0, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 412.0ms AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 12.5ms SsaConstructionTime, 41.4ms SatisfiabilityAnalysisTime, 374.4ms InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 275 SizeOfPredicates, 0 NumberOfNonLiveVariables, 82 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 40/120 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...