/usr/bin/java -Xmx8000000000 -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.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 17:04:21,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 17:04:21,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 17:04:21,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 17:04:21,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 17:04:21,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 17:04:21,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 17:04:21,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 17:04:21,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 17:04:21,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 17:04:21,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 17:04:21,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 17:04:21,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 17:04:21,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 17:04:21,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 17:04:21,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 17:04:21,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 17:04:21,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 17:04:21,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 17:04:21,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 17:04:21,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 17:04:21,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 17:04:21,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 17:04:21,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 17:04:21,988 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 17:04:21,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 17:04:21,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 17:04:21,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 17:04:21,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 17:04:21,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 17:04:21,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 17:04:21,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 17:04:21,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 17:04:21,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 17:04:21,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 17:04:21,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 17:04:21,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 17:04:21,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 17:04:21,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 17:04:21,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 17:04:21,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 17:04:21,996 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 [2022-03-01 17:04:22,026 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 17:04:22,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 17:04:22,027 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 17:04:22,027 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 17:04:22,027 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 17:04:22,027 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 17:04:22,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 17:04:22,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 17:04:22,028 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 17:04:22,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 17:04:22,028 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 17:04:22,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 17:04:22,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 17:04:22,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 17:04:22,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 17:04:22,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 17:04:22,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 17:04:22,029 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 17:04:22,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 17:04:22,029 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 17:04:22,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 17:04:22,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 17:04:22,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 17:04:22,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 17:04:22,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 17:04:22,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 17:04:22,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 17:04:22,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 17:04:22,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 17:04:22,030 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 17:04:22,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 17:04:22,031 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 17:04:22,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 17:04:22,031 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 [2022-03-01 17:04:22,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 17:04:22,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 17:04:22,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 17:04:22,234 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-01 17:04:22,236 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-01 17:04:22,236 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/bigNumberOfThreads.bpl [2022-03-01 17:04:22,237 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/bigNumberOfThreads.bpl' [2022-03-01 17:04:22,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 17:04:22,253 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-01 17:04:22,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 17:04:22,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 17:04:22,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 17:04:22,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:04:22" (1/1) ... [2022-03-01 17:04:22,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:04:22" (1/1) ... [2022-03-01 17:04:22,271 INFO L137 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-01 17:04:22,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 17:04:22,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 17:04:22,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 17:04:22,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 17:04:22,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:04:22" (1/1) ... [2022-03-01 17:04:22,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:04:22" (1/1) ... [2022-03-01 17:04:22,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:04:22" (1/1) ... [2022-03-01 17:04:22,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:04:22" (1/1) ... [2022-03-01 17:04:22,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:04:22" (1/1) ... [2022-03-01 17:04:22,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:04:22" (1/1) ... [2022-03-01 17:04:22,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:04:22" (1/1) ... [2022-03-01 17:04:22,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 17:04:22,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 17:04:22,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 17:04:22,286 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 17:04:22,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:04:22" (1/1) ... [2022-03-01 17:04:22,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 17:04:22,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:04:22,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-01 17:04:22,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-01 17:04:22,353 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-01 17:04:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 17:04:22,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 17:04:22,353 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2022-03-01 17:04:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2022-03-01 17:04:22,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2022-03-01 17:04:22,354 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 17:04:22,383 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 17:04:22,384 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 17:04:22,447 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 17:04:22,454 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 17:04:22,455 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-01 17:04:22,456 INFO L202 PluginConnector]: Adding new model bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 05:04:22 BoogieIcfgContainer [2022-03-01 17:04:22,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 17:04:22,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 17:04:22,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 17:04:22,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 17:04:22,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:04:22" (1/2) ... [2022-03-01 17:04:22,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdf248d and model type bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 05:04:22, skipping insertion in model container [2022-03-01 17:04:22,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 05:04:22" (2/2) ... [2022-03-01 17:04:22,463 INFO L111 eAbstractionObserver]: Analyzing ICFG bigNumberOfThreads.bpl [2022-03-01 17:04:22,477 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 17:04:22,477 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 17:04:22,477 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-01 17:04:22,477 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 17:04:22,509 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-01 17:04:22,545 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 17:04:22,552 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 17:04:22,552 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-03-01 17:04:22,558 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions, 29 flow [2022-03-01 17:04:22,570 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 24 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:22,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:22,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-03-01 17:04:22,576 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:04:22,577 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-03-01 17:04:22,578 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-03-01 17:04:22,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:04:22,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1418148, now seen corresponding path program 1 times [2022-03-01 17:04:22,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:04:22,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865928460] [2022-03-01 17:04:22,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:22,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:04:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:04:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:22,696 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:04:22,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865928460] [2022-03-01 17:04:22,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865928460] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:04:22,697 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:04:22,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 17:04:22,698 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106887252] [2022-03-01 17:04:22,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:04:22,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 17:04:22,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:04:22,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 17:04:22,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:04:22,741 INFO L87 Difference]: Start difference. First operand has 24 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 23 states have internal predecessors, (33), 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) [2022-03-01 17:04:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:04:22,774 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2022-03-01 17:04:22,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 17:04:22,776 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 [2022-03-01 17:04:22,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:04:22,799 INFO L225 Difference]: With dead ends: 22 [2022-03-01 17:04:22,800 INFO L226 Difference]: Without dead ends: 22 [2022-03-01 17:04:22,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:04:22,803 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:04:22,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 12 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 17:04:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-03-01 17:04:22,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-03-01 17:04:22,836 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) [2022-03-01 17:04:22,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2022-03-01 17:04:22,837 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 4 [2022-03-01 17:04:22,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:04:22,837 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-03-01 17:04:22,838 INFO L471 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) [2022-03-01 17:04:22,838 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2022-03-01 17:04:22,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-03-01 17:04:22,838 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:04:22,838 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-03-01 17:04:22,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 17:04:22,838 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-03-01 17:04:22,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:04:22,839 INFO L85 PathProgramCache]: Analyzing trace with hash -702325813, now seen corresponding path program 1 times [2022-03-01 17:04:22,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:04:22,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839776105] [2022-03-01 17:04:22,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:22,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:04:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 17:04:22,846 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-01 17:04:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 17:04:22,859 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-01 17:04:22,859 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-01 17:04:22,862 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 2 remaining) [2022-03-01 17:04:22,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 2 remaining) [2022-03-01 17:04:22,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 17:04:22,882 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-03-01 17:04:22,883 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-03-01 17:04:22,883 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-03-01 17:04:22,904 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-01 17:04:22,913 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 17:04:22,914 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 17:04:22,914 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-03-01 17:04:22,915 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 15 transitions, 42 flow [2022-03-01 17:04:22,929 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 75 states, 71 states have (on average 2.084507042253521) internal successors, (148), 74 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 71 states have (on average 2.084507042253521) internal successors, (148), 74 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-03-01 17:04:22,930 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:04:22,930 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-03-01 17:04:22,931 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-03-01 17:04:22,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:04:22,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1879908, now seen corresponding path program 1 times [2022-03-01 17:04:22,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:04:22,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959989459] [2022-03-01 17:04:22,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:22,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:04:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:04:22,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:22,953 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:04:22,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959989459] [2022-03-01 17:04:22,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959989459] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:04:22,954 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:04:22,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 17:04:22,954 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204410716] [2022-03-01 17:04:22,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:04:22,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 17:04:22,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:04:22,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 17:04:22,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:04:22,956 INFO L87 Difference]: Start difference. First operand has 75 states, 71 states have (on average 2.084507042253521) internal successors, (148), 74 states have internal predecessors, (148), 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) [2022-03-01 17:04:22,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:04:22,968 INFO L93 Difference]: Finished difference Result 73 states and 146 transitions. [2022-03-01 17:04:22,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 17:04:22,969 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 [2022-03-01 17:04:22,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:04:22,970 INFO L225 Difference]: With dead ends: 73 [2022-03-01 17:04:22,970 INFO L226 Difference]: Without dead ends: 73 [2022-03-01 17:04:22,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:04:22,971 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:04:22,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 16 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 17:04:22,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-03-01 17:04:22,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-03-01 17:04:22,978 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) [2022-03-01 17:04:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 146 transitions. [2022-03-01 17:04:22,980 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 146 transitions. Word has length 4 [2022-03-01 17:04:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:04:22,980 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 146 transitions. [2022-03-01 17:04:22,980 INFO L471 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) [2022-03-01 17:04:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 146 transitions. [2022-03-01 17:04:22,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-03-01 17:04:22,981 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:04:22,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:04:22,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 17:04:22,981 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-03-01 17:04:22,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:04:22,981 INFO L85 PathProgramCache]: Analyzing trace with hash 169138961, now seen corresponding path program 1 times [2022-03-01 17:04:22,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:04:22,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083072816] [2022-03-01 17:04:22,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:22,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:04:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:04:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:23,010 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:04:23,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083072816] [2022-03-01 17:04:23,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083072816] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:04:23,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034275078] [2022-03-01 17:04:23,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:23,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:04:23,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:04:23,013 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 17:04:23,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-01 17:04:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:04:23,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-01 17:04:23,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:04:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:23,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:04:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:23,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034275078] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 17:04:23,089 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 17:04:23,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-03-01 17:04:23,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346340585] [2022-03-01 17:04:23,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 17:04:23,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 17:04:23,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:04:23,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 17:04:23,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:04:23,090 INFO L87 Difference]: Start difference. First operand 73 states and 146 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:23,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:04:23,104 INFO L93 Difference]: Finished difference Result 49 states and 94 transitions. [2022-03-01 17:04:23,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-01 17:04:23,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 [2022-03-01 17:04:23,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:04:23,105 INFO L225 Difference]: With dead ends: 49 [2022-03-01 17:04:23,105 INFO L226 Difference]: Without dead ends: 49 [2022-03-01 17:04:23,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:04:23,106 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:04:23,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 20 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 17:04:23,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-03-01 17:04:23,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-03-01 17:04:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 48 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 94 transitions. [2022-03-01 17:04:23,112 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 94 transitions. Word has length 7 [2022-03-01 17:04:23,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:04:23,112 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 94 transitions. [2022-03-01 17:04:23,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 94 transitions. [2022-03-01 17:04:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-01 17:04:23,113 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:04:23,113 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2022-03-01 17:04:23,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-01 17:04:23,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:04:23,328 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-03-01 17:04:23,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:04:23,328 INFO L85 PathProgramCache]: Analyzing trace with hash 821553292, now seen corresponding path program 1 times [2022-03-01 17:04:23,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:04:23,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529290339] [2022-03-01 17:04:23,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:23,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:04:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 17:04:23,334 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-01 17:04:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 17:04:23,338 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-01 17:04:23,338 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-01 17:04:23,339 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 2 remaining) [2022-03-01 17:04:23,339 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 2 remaining) [2022-03-01 17:04:23,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-01 17:04:23,339 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-03-01 17:04:23,340 WARN L235 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-03-01 17:04:23,340 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-03-01 17:04:23,343 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-01 17:04:23,344 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 17:04:23,345 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 17:04:23,345 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-03-01 17:04:23,345 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 57 flow [2022-03-01 17:04:23,382 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 228 states, 223 states have (on average 2.6681614349775784) internal successors, (595), 227 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 223 states have (on average 2.6681614349775784) internal successors, (595), 227 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:23,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-03-01 17:04:23,383 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:04:23,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-03-01 17:04:23,384 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-03-01 17:04:23,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:04:23,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2434020, now seen corresponding path program 1 times [2022-03-01 17:04:23,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:04:23,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287211197] [2022-03-01 17:04:23,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:23,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:04:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:04:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:23,410 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:04:23,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287211197] [2022-03-01 17:04:23,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287211197] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:04:23,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:04:23,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 17:04:23,411 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090194557] [2022-03-01 17:04:23,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:04:23,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 17:04:23,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:04:23,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 17:04:23,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:04:23,412 INFO L87 Difference]: Start difference. First operand has 228 states, 223 states have (on average 2.6681614349775784) internal successors, (595), 227 states have internal predecessors, (595), 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) [2022-03-01 17:04:23,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:04:23,447 INFO L93 Difference]: Finished difference Result 226 states and 593 transitions. [2022-03-01 17:04:23,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 17:04:23,448 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 [2022-03-01 17:04:23,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:04:23,451 INFO L225 Difference]: With dead ends: 226 [2022-03-01 17:04:23,451 INFO L226 Difference]: Without dead ends: 226 [2022-03-01 17:04:23,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:04:23,452 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:04:23,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 20 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 17:04:23,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-03-01 17:04:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-03-01 17:04:23,472 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) [2022-03-01 17:04:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 593 transitions. [2022-03-01 17:04:23,483 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 593 transitions. Word has length 4 [2022-03-01 17:04:23,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:04:23,483 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 593 transitions. [2022-03-01 17:04:23,483 INFO L471 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) [2022-03-01 17:04:23,483 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 593 transitions. [2022-03-01 17:04:23,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-03-01 17:04:23,484 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:04:23,484 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:04:23,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-01 17:04:23,484 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-03-01 17:04:23,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:04:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash -503102175, now seen corresponding path program 1 times [2022-03-01 17:04:23,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:04:23,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538462709] [2022-03-01 17:04:23,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:23,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:04:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:04:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:23,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:04:23,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538462709] [2022-03-01 17:04:23,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538462709] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:04:23,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36044057] [2022-03-01 17:04:23,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:23,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:04:23,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:04:23,514 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 17:04:23,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-01 17:04:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:04:23,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-01 17:04:23,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:04:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:23,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:04:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:23,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36044057] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 17:04:23,577 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 17:04:23,578 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-03-01 17:04:23,578 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379114817] [2022-03-01 17:04:23,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 17:04:23,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 17:04:23,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:04:23,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 17:04:23,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:04:23,579 INFO L87 Difference]: Start difference. First operand 226 states and 593 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:04:23,595 INFO L93 Difference]: Finished difference Result 148 states and 379 transitions. [2022-03-01 17:04:23,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 17:04:23,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 [2022-03-01 17:04:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:04:23,597 INFO L225 Difference]: With dead ends: 148 [2022-03-01 17:04:23,597 INFO L226 Difference]: Without dead ends: 148 [2022-03-01 17:04:23,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:04:23,598 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:04:23,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 30 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 17:04:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-03-01 17:04:23,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-03-01 17:04:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 2.578231292517007) internal successors, (379), 147 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 379 transitions. [2022-03-01 17:04:23,608 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 379 transitions. Word has length 7 [2022-03-01 17:04:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:04:23,608 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 379 transitions. [2022-03-01 17:04:23,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:23,609 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 379 transitions. [2022-03-01 17:04:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-01 17:04:23,609 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:04:23,609 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-03-01 17:04:23,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-01 17:04:23,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-03-01 17:04:23,816 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-03-01 17:04:23,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:04:23,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1531306539, now seen corresponding path program 1 times [2022-03-01 17:04:23,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:04:23,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158329733] [2022-03-01 17:04:23,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:23,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:04:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 17:04:23,824 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-01 17:04:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 17:04:23,832 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-01 17:04:23,833 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-01 17:04:23,833 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 2 remaining) [2022-03-01 17:04:23,833 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 2 remaining) [2022-03-01 17:04:23,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-01 17:04:23,834 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-03-01 17:04:23,834 WARN L235 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-03-01 17:04:23,834 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-03-01 17:04:23,840 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-01 17:04:23,841 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 17:04:23,841 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 17:04:23,841 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-03-01 17:04:23,842 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 21 transitions, 74 flow [2022-03-01 17:04:23,875 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 687 states, 681 states have (on average 3.292217327459618) internal successors, (2242), 686 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 687 states, 681 states have (on average 3.292217327459618) internal successors, (2242), 686 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-03-01 17:04:23,876 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:04:23,877 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-03-01 17:04:23,877 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-03-01 17:04:23,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:04:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash 3080484, now seen corresponding path program 1 times [2022-03-01 17:04:23,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:04:23,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187916743] [2022-03-01 17:04:23,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:23,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:04:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:04:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:23,898 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:04:23,898 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187916743] [2022-03-01 17:04:23,898 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187916743] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:04:23,898 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:04:23,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 17:04:23,898 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258552637] [2022-03-01 17:04:23,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:04:23,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 17:04:23,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:04:23,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 17:04:23,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:04:23,900 INFO L87 Difference]: Start difference. First operand has 687 states, 681 states have (on average 3.292217327459618) internal successors, (2242), 686 states have internal predecessors, (2242), 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) [2022-03-01 17:04:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:04:23,925 INFO L93 Difference]: Finished difference Result 685 states and 2240 transitions. [2022-03-01 17:04:23,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 17:04:23,925 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 [2022-03-01 17:04:23,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:04:23,930 INFO L225 Difference]: With dead ends: 685 [2022-03-01 17:04:23,931 INFO L226 Difference]: Without dead ends: 685 [2022-03-01 17:04:23,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:04:23,931 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:04:23,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 24 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 17:04:23,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-03-01 17:04:23,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2022-03-01 17:04:23,998 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) [2022-03-01 17:04:24,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 2240 transitions. [2022-03-01 17:04:24,001 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 2240 transitions. Word has length 4 [2022-03-01 17:04:24,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:04:24,001 INFO L470 AbstractCegarLoop]: Abstraction has 685 states and 2240 transitions. [2022-03-01 17:04:24,002 INFO L471 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) [2022-03-01 17:04:24,002 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 2240 transitions. [2022-03-01 17:04:24,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-03-01 17:04:24,002 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:04:24,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:04:24,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-01 17:04:24,002 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-03-01 17:04:24,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:04:24,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1575918100, now seen corresponding path program 1 times [2022-03-01 17:04:24,003 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:04:24,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77921450] [2022-03-01 17:04:24,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:24,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:04:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:04:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:24,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:04:24,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77921450] [2022-03-01 17:04:24,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77921450] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:04:24,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574369724] [2022-03-01 17:04:24,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:24,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:04:24,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:04:24,029 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 17:04:24,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-01 17:04:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:04:24,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-01 17:04:24,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:04:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:24,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:04:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:24,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574369724] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 17:04:24,093 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 17:04:24,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-03-01 17:04:24,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182039597] [2022-03-01 17:04:24,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 17:04:24,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 17:04:24,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:04:24,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 17:04:24,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:04:24,094 INFO L87 Difference]: Start difference. First operand 685 states and 2240 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:04:24,123 INFO L93 Difference]: Finished difference Result 607 states and 2026 transitions. [2022-03-01 17:04:24,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 17:04:24,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 [2022-03-01 17:04:24,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:04:24,126 INFO L225 Difference]: With dead ends: 607 [2022-03-01 17:04:24,126 INFO L226 Difference]: Without dead ends: 607 [2022-03-01 17:04:24,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:04:24,127 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 49 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:04:24,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 49 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 17:04:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2022-03-01 17:04:24,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2022-03-01 17:04:24,139 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) [2022-03-01 17:04:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 2026 transitions. [2022-03-01 17:04:24,142 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 2026 transitions. Word has length 7 [2022-03-01 17:04:24,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:04:24,142 INFO L470 AbstractCegarLoop]: Abstraction has 607 states and 2026 transitions. [2022-03-01 17:04:24,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 2026 transitions. [2022-03-01 17:04:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-01 17:04:24,143 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:04:24,143 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:04:24,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-01 17:04:24,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:04:24,362 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-03-01 17:04:24,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:04:24,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1105790513, now seen corresponding path program 1 times [2022-03-01 17:04:24,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:04:24,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905927029] [2022-03-01 17:04:24,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:24,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:04:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 17:04:24,377 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-01 17:04:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 17:04:24,384 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-01 17:04:24,384 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-01 17:04:24,384 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 2 remaining) [2022-03-01 17:04:24,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 2 remaining) [2022-03-01 17:04:24,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-01 17:04:24,384 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-03-01 17:04:24,385 WARN L235 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2022-03-01 17:04:24,385 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2022-03-01 17:04:24,389 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-01 17:04:24,390 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 17:04:24,390 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 17:04:24,390 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-03-01 17:04:24,391 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 24 transitions, 93 flow [2022-03-01 17:04:24,461 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2064 states, 2057 states have (on average 3.9382596013612057) internal successors, (8101), 2063 states have internal predecessors, (8101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 2064 states, 2057 states have (on average 3.9382596013612057) internal successors, (8101), 2063 states have internal predecessors, (8101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:24,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-03-01 17:04:24,466 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:04:24,467 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-03-01 17:04:24,467 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-03-01 17:04:24,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:04:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash 3819300, now seen corresponding path program 1 times [2022-03-01 17:04:24,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:04:24,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26731201] [2022-03-01 17:04:24,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:24,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:04:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:04:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:24,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:04:24,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26731201] [2022-03-01 17:04:24,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26731201] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:04:24,488 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:04:24,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 17:04:24,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492376022] [2022-03-01 17:04:24,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:04:24,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 17:04:24,489 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:04:24,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 17:04:24,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:04:24,495 INFO L87 Difference]: Start difference. First operand has 2064 states, 2057 states have (on average 3.9382596013612057) internal successors, (8101), 2063 states have internal predecessors, (8101), 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) [2022-03-01 17:04:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:04:24,525 INFO L93 Difference]: Finished difference Result 2062 states and 8099 transitions. [2022-03-01 17:04:24,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 17:04:24,526 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 [2022-03-01 17:04:24,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:04:24,537 INFO L225 Difference]: With dead ends: 2062 [2022-03-01 17:04:24,537 INFO L226 Difference]: Without dead ends: 2062 [2022-03-01 17:04:24,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:04:24,539 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:04:24,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 28 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 17:04:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2022-03-01 17:04:24,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 2062. [2022-03-01 17:04:24,611 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) [2022-03-01 17:04:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 8099 transitions. [2022-03-01 17:04:24,620 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 8099 transitions. Word has length 4 [2022-03-01 17:04:24,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:04:24,620 INFO L470 AbstractCegarLoop]: Abstraction has 2062 states and 8099 transitions. [2022-03-01 17:04:24,620 INFO L471 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) [2022-03-01 17:04:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 8099 transitions. [2022-03-01 17:04:24,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-03-01 17:04:24,620 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:04:24,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:04:24,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-01 17:04:24,622 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-03-01 17:04:24,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:04:24,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2111232490, now seen corresponding path program 1 times [2022-03-01 17:04:24,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:04:24,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527270637] [2022-03-01 17:04:24,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:24,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:04:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:04:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:24,663 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:04:24,663 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527270637] [2022-03-01 17:04:24,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527270637] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:04:24,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054924018] [2022-03-01 17:04:24,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:24,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:04:24,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:04:24,665 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 17:04:24,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-01 17:04:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:04:24,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-01 17:04:24,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:04:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:24,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:04:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:24,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054924018] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 17:04:24,744 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 17:04:24,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-03-01 17:04:24,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330095633] [2022-03-01 17:04:24,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 17:04:24,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 17:04:24,744 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:04:24,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 17:04:24,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:04:24,745 INFO L87 Difference]: Start difference. First operand 2062 states and 8099 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:04:24,774 INFO L93 Difference]: Finished difference Result 1984 states and 7885 transitions. [2022-03-01 17:04:24,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 17:04:24,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 [2022-03-01 17:04:24,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:04:24,785 INFO L225 Difference]: With dead ends: 1984 [2022-03-01 17:04:24,785 INFO L226 Difference]: Without dead ends: 1984 [2022-03-01 17:04:24,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 17:04:24,787 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 49 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:04:24,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 60 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 17:04:24,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2022-03-01 17:04:24,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1984. [2022-03-01 17:04:24,828 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) [2022-03-01 17:04:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 7885 transitions. [2022-03-01 17:04:24,836 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 7885 transitions. Word has length 7 [2022-03-01 17:04:24,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:04:24,836 INFO L470 AbstractCegarLoop]: Abstraction has 1984 states and 7885 transitions. [2022-03-01 17:04:24,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:04:24,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 7885 transitions. [2022-03-01 17:04:24,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-01 17:04:24,837 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:04:24,837 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:04:24,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-01 17:04:25,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:04:25,052 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-03-01 17:04:25,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:04:25,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1631084642, now seen corresponding path program 1 times [2022-03-01 17:04:25,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:04:25,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065426124] [2022-03-01 17:04:25,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:25,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:04:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:04:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:25,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:04:25,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065426124] [2022-03-01 17:04:25,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065426124] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 17:04:25,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542408008] [2022-03-01 17:04:25,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:25,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 17:04:25,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:04:25,089 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 17:04:25,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-01 17:04:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:04:25,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-01 17:04:25,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 17:04:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:25,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 17:04:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:25,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542408008] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 17:04:25,180 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 17:04:25,181 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-03-01 17:04:25,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928449160] [2022-03-01 17:04:25,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 17:04:25,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 17:04:25,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:04:25,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 17:04:25,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-01 17:04:25,182 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) [2022-03-01 17:04:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:04:25,210 INFO L93 Difference]: Finished difference Result 1822 states and 7291 transitions. [2022-03-01 17:04:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 17:04:25,211 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 [2022-03-01 17:04:25,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:04:25,221 INFO L225 Difference]: With dead ends: 1822 [2022-03-01 17:04:25,221 INFO L226 Difference]: Without dead ends: 1822 [2022-03-01 17:04:25,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-01 17:04:25,221 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 60 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:04:25,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 62 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 17:04:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2022-03-01 17:04:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1822. [2022-03-01 17:04:25,258 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) [2022-03-01 17:04:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 7291 transitions. [2022-03-01 17:04:25,265 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 7291 transitions. Word has length 16 [2022-03-01 17:04:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:04:25,266 INFO L470 AbstractCegarLoop]: Abstraction has 1822 states and 7291 transitions. [2022-03-01 17:04:25,266 INFO L471 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) [2022-03-01 17:04:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 7291 transitions. [2022-03-01 17:04:25,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-01 17:04:25,268 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:04:25,268 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:04:25,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-01 17:04:25,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-01 17:04:25,483 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-03-01 17:04:25,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:04:25,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1617682089, now seen corresponding path program 1 times [2022-03-01 17:04:25,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:04:25,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522432925] [2022-03-01 17:04:25,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:25,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:04:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:04:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:04:25,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:04:25,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522432925] [2022-03-01 17:04:25,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522432925] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:04:25,525 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:04:25,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-01 17:04:25,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221707078] [2022-03-01 17:04:25,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:04:25,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-01 17:04:25,525 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:04:25,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-01 17:04:25,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-03-01 17:04:25,526 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) [2022-03-01 17:04:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:04:25,556 INFO L93 Difference]: Finished difference Result 1336 states and 5185 transitions. [2022-03-01 17:04:25,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-01 17:04:25,556 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 [2022-03-01 17:04:25,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:04:25,563 INFO L225 Difference]: With dead ends: 1336 [2022-03-01 17:04:25,563 INFO L226 Difference]: Without dead ends: 1336 [2022-03-01 17:04:25,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-03-01 17:04:25,565 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 57 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:04:25,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 94 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 17:04:25,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2022-03-01 17:04:25,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2022-03-01 17:04:25,610 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) [2022-03-01 17:04:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 5185 transitions. [2022-03-01 17:04:25,614 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 5185 transitions. Word has length 19 [2022-03-01 17:04:25,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:04:25,615 INFO L470 AbstractCegarLoop]: Abstraction has 1336 states and 5185 transitions. [2022-03-01 17:04:25,615 INFO L471 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) [2022-03-01 17:04:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 5185 transitions. [2022-03-01 17:04:25,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-01 17:04:25,616 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:04:25,616 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:04:25,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-01 17:04:25,616 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-03-01 17:04:25,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:04:25,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1617682072, now seen corresponding path program 1 times [2022-03-01 17:04:25,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:04:25,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979155388] [2022-03-01 17:04:25,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:04:25,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:04:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 17:04:25,631 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-01 17:04:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 17:04:25,645 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-01 17:04:25,645 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-01 17:04:25,645 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (1 of 2 remaining) [2022-03-01 17:04:25,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 2 remaining) [2022-03-01 17:04:25,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-01 17:04:25,646 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-03-01 17:04:25,648 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 5 thread instances [2022-03-01 17:04:25,648 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-01 17:04:25,661 INFO L202 PluginConnector]: Adding new model bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.03 05:04:25 BasicIcfg [2022-03-01 17:04:25,661 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-01 17:04:25,661 INFO L158 Benchmark]: Toolchain (without parser) took 3407.97ms. Allocated memory was 218.1MB in the beginning and 262.1MB in the end (delta: 44.0MB). Free memory was 182.3MB in the beginning and 203.0MB in the end (delta: -20.7MB). Peak memory consumption was 23.8MB. Max. memory is 8.0GB. [2022-03-01 17:04:25,661 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 218.1MB. Free memory was 183.3MB in the beginning and 183.2MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 17:04:25,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.78ms. Allocated memory is still 218.1MB. Free memory was 182.3MB in the beginning and 180.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-01 17:04:25,662 INFO L158 Benchmark]: Boogie Preprocessor took 10.33ms. Allocated memory is still 218.1MB. Free memory was 180.6MB in the beginning and 179.8MB in the end (delta: 887.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-01 17:04:25,662 INFO L158 Benchmark]: RCFGBuilder took 170.12ms. Allocated memory is still 218.1MB. Free memory was 179.8MB in the beginning and 171.6MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-03-01 17:04:25,662 INFO L158 Benchmark]: TraceAbstraction took 3203.45ms. Allocated memory was 218.1MB in the beginning and 262.1MB in the end (delta: 44.0MB). Free memory was 171.1MB in the beginning and 203.0MB in the end (delta: -31.9MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-03-01 17:04:25,664 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.10ms. Allocated memory is still 218.1MB. Free memory was 183.3MB in the beginning and 183.2MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.78ms. Allocated memory is still 218.1MB. Free memory was 182.3MB in the beginning and 180.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 10.33ms. Allocated memory is still 218.1MB. Free memory was 180.6MB in the beginning and 179.8MB in the end (delta: 887.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 170.12ms. Allocated memory is still 218.1MB. Free memory was 179.8MB in the beginning and 171.6MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 3203.45ms. Allocated memory was 218.1MB in the beginning and 262.1MB in the end (delta: 44.0MB). Free memory was 171.1MB in the beginning and 203.0MB in the end (delta: -31.9MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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] - UnprovableResult [Line: 30]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 16 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 7 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred 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.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s 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. OverallTime: 0.4s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 16 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 47 SizeOfPredicates, 0 NumberOfNonLiveVariables, 13 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 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. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 20 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 47 SizeOfPredicates, 0 NumberOfNonLiveVariables, 13 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 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. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 26 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=687occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 47 SizeOfPredicates, 0 NumberOfNonLiveVariables, 13 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 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. OverallTime: 1.3s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 88 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2064occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 41 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 40/109 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! [2022-03-01 17:04:25,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...