/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/ForkInLoop02-Incrementer.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:33:50,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:33:50,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:33:50,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:33:50,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:33:50,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:33:50,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:33:50,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:33:50,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:33:50,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:33:50,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:33:50,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:33:50,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:33:50,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:33:50,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:33:50,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:33:50,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:33:50,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:33:50,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:33:50,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:33:50,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:33:50,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:33:50,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:33:50,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:33:50,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:33:50,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:33:50,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:33:50,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:33:50,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:33:50,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:33:50,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:33:50,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:33:50,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:33:50,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:33:50,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:33:50,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:33:50,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:33:50,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:33:50,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:33:50,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:33:50,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:33:50,589 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:33:50,617 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:33:50,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:33:50,618 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:33:50,618 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:33:50,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:33:50,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:33:50,619 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:33:50,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:33:50,619 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:33:50,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:33:50,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:33:50,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:33:50,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:33:50,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:33:50,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:33:50,620 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:33:50,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:33:50,620 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:33:50,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:33:50,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:33:50,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:33:50,621 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:33:50,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:33:50,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:33:50,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:33:50,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:33:50,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:33:50,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:33:50,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:33:50,622 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:33:50,622 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:33:50,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:33:50,622 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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-15 20:33:50,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:33:50,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:33:50,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:33:50,824 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 20:33:50,825 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 20:33:50,826 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/ForkInLoop02-Incrementer.bpl [2022-03-15 20:33:50,826 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/ForkInLoop02-Incrementer.bpl' [2022-03-15 20:33:50,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:33:50,843 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 20:33:50,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:33:50,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:33:50,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:33:50,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:33:50" (1/1) ... [2022-03-15 20:33:50,859 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:33:50" (1/1) ... [2022-03-15 20:33:50,864 INFO L137 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 20:33:50,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:33:50,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:33:50,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:33:50,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:33:50,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:33:50" (1/1) ... [2022-03-15 20:33:50,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:33:50" (1/1) ... [2022-03-15 20:33:50,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:33:50" (1/1) ... [2022-03-15 20:33:50,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:33:50" (1/1) ... [2022-03-15 20:33:50,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:33:50" (1/1) ... [2022-03-15 20:33:50,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:33:50" (1/1) ... [2022-03-15 20:33:50,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:33:50" (1/1) ... [2022-03-15 20:33:50,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:33:50,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:33:50,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:33:50,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:33:50,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:33:50" (1/1) ... [2022-03-15 20:33:50,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:33:50,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:33:50,911 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-15 20:33:50,912 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-15 20:33:50,940 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2022-03-15 20:33:50,940 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2022-03-15 20:33:50,940 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2022-03-15 20:33:50,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:33:50,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:33:50,941 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:33:50,978 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:33:50,979 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:33:51,024 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:33:51,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:33:51,029 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-15 20:33:51,030 INFO L202 PluginConnector]: Adding new model ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:33:51 BoogieIcfgContainer [2022-03-15 20:33:51,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:33:51,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:33:51,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:33:51,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:33:51,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 08:33:50" (1/2) ... [2022-03-15 20:33:51,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19348240 and model type ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:33:51, skipping insertion in model container [2022-03-15 20:33:51,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:33:51" (2/2) ... [2022-03-15 20:33:51,045 INFO L111 eAbstractionObserver]: Analyzing ICFG ForkInLoop02-Incrementer.bpl [2022-03-15 20:33:51,048 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:33:51,049 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:33:51,049 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 20:33:51,049 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:33:51,068 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 20:33:51,103 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:33:51,109 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:33:51,109 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 20:33:51,117 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:33:51,125 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 13 places, 10 transitions, 25 flow [2022-03-15 20:33:51,128 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 13 places, 10 transitions, 25 flow [2022-03-15 20:33:51,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 13 places, 10 transitions, 25 flow [2022-03-15 20:33:51,143 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2022-03-15 20:33:51,143 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 20:33:51,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16 conditions, 11 events. 0/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 12 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-03-15 20:33:51,145 INFO L116 LiptonReduction]: Number of co-enabled transitions 24 [2022-03-15 20:33:51,255 INFO L131 LiptonReduction]: Checked pairs total: 9 [2022-03-15 20:33:51,255 INFO L133 LiptonReduction]: Total number of compositions: 4 [2022-03-15 20:33:51,262 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 10 places, 7 transitions, 19 flow [2022-03-15 20:33:51,270 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 13 states, 10 states have (on average 1.7) internal successors, (17), 12 states have internal predecessors, (17), 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-15 20:33:51,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 10 states have (on average 1.7) internal successors, (17), 12 states have internal predecessors, (17), 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-15 20:33:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-03-15 20:33:51,293 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:33:51,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-03-15 20:33:51,310 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting fooErr0ASSERT_VIOLATIONASSERT === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT] === [2022-03-15 20:33:51,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:33:51,315 INFO L85 PathProgramCache]: Analyzing trace with hash 59486, now seen corresponding path program 1 times [2022-03-15 20:33:51,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:33:51,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625881736] [2022-03-15 20:33:51,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:33:51,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:33:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:33:51,449 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-15 20:33:51,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:33:51,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625881736] [2022-03-15 20:33:51,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625881736] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:33:51,457 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:33:51,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 20:33:51,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [814857683] [2022-03-15 20:33:51,459 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:33:51,461 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:33:51,468 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2022-03-15 20:33:51,468 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:33:51,471 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:33:51,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:33:51,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:33:51,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:33:51,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:33:51,507 INFO L87 Difference]: Start difference. First operand has 13 states, 10 states have (on average 1.7) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-15 20:33:51,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:33:51,539 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-03-15 20:33:51,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:33:51,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2022-03-15 20:33:51,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:33:51,548 INFO L225 Difference]: With dead ends: 9 [2022-03-15 20:33:51,548 INFO L226 Difference]: Without dead ends: 8 [2022-03-15 20:33:51,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-15 20:33:51,556 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:33:51,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 5 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:33:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-03-15 20:33:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-03-15 20:33:51,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:33:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-03-15 20:33:51,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 3 [2022-03-15 20:33:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:33:51,586 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-03-15 20:33:51,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-15 20:33:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2022-03-15 20:33:51,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-03-15 20:33:51,587 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:33:51,587 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-03-15 20:33:51,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:33:51,589 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT] === [2022-03-15 20:33:51,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:33:51,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1843751, now seen corresponding path program 1 times [2022-03-15 20:33:51,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:33:51,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784409887] [2022-03-15 20:33:51,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:33:51,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:33:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:33:51,599 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 20:33:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:33:51,611 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 20:33:51,611 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 20:33:51,612 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 3 remaining) [2022-03-15 20:33:51,614 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr0ASSERT_VIOLATIONASSERT (1 of 3 remaining) [2022-03-15 20:33:51,614 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr0ASSERT_VIOLATIONASSERT (0 of 3 remaining) [2022-03-15 20:33:51,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:33:51,616 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-03-15 20:33:51,617 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-03-15 20:33:51,617 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-03-15 20:33:51,622 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 20:33:51,624 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:33:51,625 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:33:51,625 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 20:33:51,626 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:33:51,626 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 15 transitions, 42 flow [2022-03-15 20:33:51,626 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 15 transitions, 42 flow [2022-03-15 20:33:51,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 20 places, 15 transitions, 42 flow [2022-03-15 20:33:51,632 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2022-03-15 20:33:51,632 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 20:33:51,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 0/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-03-15 20:33:51,633 INFO L116 LiptonReduction]: Number of co-enabled transitions 88 [2022-03-15 20:33:51,662 INFO L131 LiptonReduction]: Checked pairs total: 119 [2022-03-15 20:33:51,662 INFO L133 LiptonReduction]: Total number of compositions: 3 [2022-03-15 20:33:51,663 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 17 places, 12 transitions, 36 flow [2022-03-15 20:33:51,674 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 76 states, 68 states have (on average 2.3823529411764706) internal successors, (162), 75 states have internal predecessors, (162), 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-15 20:33:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 68 states have (on average 2.3823529411764706) internal successors, (162), 75 states have internal predecessors, (162), 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-15 20:33:51,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-03-15 20:33:51,675 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:33:51,675 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-03-15 20:33:51,675 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting fooErr0ASSERT_VIOLATIONASSERT === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT] === [2022-03-15 20:33:51,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:33:51,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2581598, now seen corresponding path program 1 times [2022-03-15 20:33:51,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:33:51,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132909536] [2022-03-15 20:33:51,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:33:51,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:33:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:33:51,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-15 20:33:51,696 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:33:51,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132909536] [2022-03-15 20:33:51,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132909536] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:33:51,697 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:33:51,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:33:51,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1275575323] [2022-03-15 20:33:51,697 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:33:51,697 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:33:51,698 INFO L252 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2022-03-15 20:33:51,698 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:33:51,699 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:33:51,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 20:33:51,699 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:33:51,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 20:33:51,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:33:51,700 INFO L87 Difference]: Start difference. First operand has 76 states, 68 states have (on average 2.3823529411764706) internal successors, (162), 75 states have internal predecessors, (162), 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 4 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-15 20:33:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:33:51,727 INFO L93 Difference]: Finished difference Result 65 states and 134 transitions. [2022-03-15 20:33:51,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 20:33:51,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-15 20:33:51,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:33:51,729 INFO L225 Difference]: With dead ends: 65 [2022-03-15 20:33:51,729 INFO L226 Difference]: Without dead ends: 63 [2022-03-15 20:33:51,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:33:51,731 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:33:51,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 11 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:33:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-03-15 20:33:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-03-15 20:33:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 2.3392857142857144) internal successors, (131), 62 states have internal predecessors, (131), 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-15 20:33:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 131 transitions. [2022-03-15 20:33:51,741 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 131 transitions. Word has length 4 [2022-03-15 20:33:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:33:51,741 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 131 transitions. [2022-03-15 20:33:51,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-15 20:33:51,741 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 131 transitions. [2022-03-15 20:33:51,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-03-15 20:33:51,742 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:33:51,742 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2022-03-15 20:33:51,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 20:33:51,742 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT] === [2022-03-15 20:33:51,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:33:51,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1814190759, now seen corresponding path program 1 times [2022-03-15 20:33:51,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:33:51,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658624277] [2022-03-15 20:33:51,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:33:51,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:33:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:33:51,751 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 20:33:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:33:51,756 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 20:33:51,756 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 20:33:51,756 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 4 remaining) [2022-03-15 20:33:51,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr0ASSERT_VIOLATIONASSERT (2 of 4 remaining) [2022-03-15 20:33:51,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr0ASSERT_VIOLATIONASSERT (1 of 4 remaining) [2022-03-15 20:33:51,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr0ASSERT_VIOLATIONASSERT (0 of 4 remaining) [2022-03-15 20:33:51,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 20:33:51,757 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-03-15 20:33:51,758 WARN L235 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-03-15 20:33:51,758 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-03-15 20:33:51,768 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 20:33:51,770 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:33:51,771 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:33:51,771 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 20:33:51,772 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:33:51,772 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 20 transitions, 61 flow [2022-03-15 20:33:51,772 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 20 transitions, 61 flow [2022-03-15 20:33:51,772 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 27 places, 20 transitions, 61 flow [2022-03-15 20:33:51,777 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2022-03-15 20:33:51,777 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-03-15 20:33:51,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 25 events. 0/25 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-03-15 20:33:51,778 INFO L116 LiptonReduction]: Number of co-enabled transitions 192 [2022-03-15 20:33:51,809 INFO L131 LiptonReduction]: Checked pairs total: 333 [2022-03-15 20:33:51,810 INFO L133 LiptonReduction]: Total number of compositions: 4 [2022-03-15 20:33:51,810 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 16 transitions, 53 flow [2022-03-15 20:33:51,847 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 315 states, 296 states have (on average 3.0472972972972974) internal successors, (902), 314 states have internal predecessors, (902), 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-15 20:33:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 315 states, 296 states have (on average 3.0472972972972974) internal successors, (902), 314 states have internal predecessors, (902), 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-15 20:33:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-03-15 20:33:51,849 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:33:51,849 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-03-15 20:33:51,849 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting fooErr0ASSERT_VIOLATIONASSERT === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT (and 1 more)] === [2022-03-15 20:33:51,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:33:51,850 INFO L85 PathProgramCache]: Analyzing trace with hash 3472476, now seen corresponding path program 1 times [2022-03-15 20:33:51,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:33:51,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217447753] [2022-03-15 20:33:51,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:33:51,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:33:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:33:51,870 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-15 20:33:51,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:33:51,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217447753] [2022-03-15 20:33:51,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217447753] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:33:51,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:33:51,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:33:51,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1277336477] [2022-03-15 20:33:51,872 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:33:51,872 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:33:51,872 INFO L252 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2022-03-15 20:33:51,872 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:33:51,873 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:33:51,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 20:33:51,873 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:33:51,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 20:33:51,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:33:51,875 INFO L87 Difference]: Start difference. First operand has 315 states, 296 states have (on average 3.0472972972972974) internal successors, (902), 314 states have internal predecessors, (902), 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 4 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-15 20:33:51,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:33:51,924 INFO L93 Difference]: Finished difference Result 294 states and 833 transitions. [2022-03-15 20:33:51,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 20:33:51,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-15 20:33:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:33:51,942 INFO L225 Difference]: With dead ends: 294 [2022-03-15 20:33:51,943 INFO L226 Difference]: Without dead ends: 292 [2022-03-15 20:33:51,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:33:51,944 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:33:51,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 12 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:33:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-03-15 20:33:51,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-03-15 20:33:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 274 states have (on average 3.0291970802919708) internal successors, (830), 291 states have internal predecessors, (830), 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-15 20:33:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 830 transitions. [2022-03-15 20:33:51,980 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 830 transitions. Word has length 4 [2022-03-15 20:33:51,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:33:51,981 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 830 transitions. [2022-03-15 20:33:51,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-15 20:33:51,981 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 830 transitions. [2022-03-15 20:33:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-03-15 20:33:51,981 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:33:51,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:33:51,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 20:33:51,982 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting fooErr0ASSERT_VIOLATIONASSERT === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT (and 1 more)] === [2022-03-15 20:33:51,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:33:51,983 INFO L85 PathProgramCache]: Analyzing trace with hash 368977345, now seen corresponding path program 1 times [2022-03-15 20:33:51,983 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:33:51,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209987720] [2022-03-15 20:33:51,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:33:51,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:33:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:33:52,019 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-15 20:33:52,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:33:52,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209987720] [2022-03-15 20:33:52,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209987720] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:33:52,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134697565] [2022-03-15 20:33:52,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:33:52,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:33:52,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:33:52,031 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-15 20:33:52,051 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-15 20:33:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:33:52,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 20:33:52,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:33:52,144 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-15 20:33:52,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:33:52,170 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-15 20:33:52,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134697565] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:33:52,171 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:33:52,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-03-15 20:33:52,171 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [550220515] [2022-03-15 20:33:52,171 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:33:52,172 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:33:52,172 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 11 transitions. [2022-03-15 20:33:52,173 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:33:52,200 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:33:52,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 20:33:52,200 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:33:52,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 20:33:52,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 20:33:52,201 INFO L87 Difference]: Start difference. First operand 292 states and 830 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:33:52,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:33:52,254 INFO L93 Difference]: Finished difference Result 289 states and 701 transitions. [2022-03-15 20:33:52,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 20:33:52,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-03-15 20:33:52,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:33:52,259 INFO L225 Difference]: With dead ends: 289 [2022-03-15 20:33:52,259 INFO L226 Difference]: Without dead ends: 275 [2022-03-15 20:33:52,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 20:33:52,260 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:33:52,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 15 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:33:52,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-03-15 20:33:52,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 251. [2022-03-15 20:33:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 236 states have (on average 2.7288135593220337) internal successors, (644), 250 states have internal predecessors, (644), 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-15 20:33:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 644 transitions. [2022-03-15 20:33:52,287 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 644 transitions. Word has length 7 [2022-03-15 20:33:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:33:52,287 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 644 transitions. [2022-03-15 20:33:52,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:33:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 644 transitions. [2022-03-15 20:33:52,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-03-15 20:33:52,288 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:33:52,289 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2022-03-15 20:33:52,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 20:33:52,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 20:33:52,511 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT (and 1 more)] === [2022-03-15 20:33:52,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:33:52,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1801787981, now seen corresponding path program 1 times [2022-03-15 20:33:52,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:33:52,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518488857] [2022-03-15 20:33:52,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:33:52,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:33:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:33:52,521 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 20:33:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:33:52,527 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 20:33:52,527 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 20:33:52,527 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 5 remaining) [2022-03-15 20:33:52,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr0ASSERT_VIOLATIONASSERT (3 of 5 remaining) [2022-03-15 20:33:52,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr0ASSERT_VIOLATIONASSERT (2 of 5 remaining) [2022-03-15 20:33:52,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr0ASSERT_VIOLATIONASSERT (1 of 5 remaining) [2022-03-15 20:33:52,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr0ASSERT_VIOLATIONASSERT (0 of 5 remaining) [2022-03-15 20:33:52,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 20:33:52,529 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-03-15 20:33:52,529 WARN L235 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-03-15 20:33:52,529 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-03-15 20:33:52,538 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 20:33:52,540 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:33:52,541 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:33:52,541 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-15 20:33:52,543 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:33:52,543 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 82 flow [2022-03-15 20:33:52,543 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 82 flow [2022-03-15 20:33:52,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 82 flow [2022-03-15 20:33:52,550 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2022-03-15 20:33:52,550 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-03-15 20:33:52,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 32 events. 0/32 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-03-15 20:33:52,550 INFO L116 LiptonReduction]: Number of co-enabled transitions 336 [2022-03-15 20:33:52,581 INFO L131 LiptonReduction]: Checked pairs total: 624 [2022-03-15 20:33:52,581 INFO L133 LiptonReduction]: Total number of compositions: 5 [2022-03-15 20:33:52,582 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 20 transitions, 72 flow [2022-03-15 20:33:52,634 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1274 states, 1232 states have (on average 3.7280844155844157) internal successors, (4593), 1273 states have internal predecessors, (4593), 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-15 20:33:52,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 1274 states, 1232 states have (on average 3.7280844155844157) internal successors, (4593), 1273 states have internal predecessors, (4593), 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-15 20:33:52,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-03-15 20:33:52,638 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:33:52,638 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-03-15 20:33:52,638 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting fooErr0ASSERT_VIOLATIONASSERT === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT (and 2 more)] === [2022-03-15 20:33:52,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:33:52,639 INFO L85 PathProgramCache]: Analyzing trace with hash 4458173, now seen corresponding path program 1 times [2022-03-15 20:33:52,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:33:52,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443383749] [2022-03-15 20:33:52,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:33:52,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:33:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:33:52,673 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-15 20:33:52,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:33:52,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443383749] [2022-03-15 20:33:52,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443383749] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:33:52,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:33:52,674 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:33:52,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1915442622] [2022-03-15 20:33:52,674 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:33:52,674 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:33:52,674 INFO L252 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2022-03-15 20:33:52,675 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:33:52,675 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:33:52,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 20:33:52,675 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:33:52,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 20:33:52,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:33:52,679 INFO L87 Difference]: Start difference. First operand has 1274 states, 1232 states have (on average 3.7280844155844157) internal successors, (4593), 1273 states have internal predecessors, (4593), 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 4 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-15 20:33:52,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:33:52,750 INFO L93 Difference]: Finished difference Result 1240 states and 4457 transitions. [2022-03-15 20:33:52,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 20:33:52,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-15 20:33:52,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:33:52,762 INFO L225 Difference]: With dead ends: 1240 [2022-03-15 20:33:52,763 INFO L226 Difference]: Without dead ends: 1238 [2022-03-15 20:33:52,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:33:52,770 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:33:52,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 13 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:33:52,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2022-03-15 20:33:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1238. [2022-03-15 20:33:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1197 states have (on average 3.720969089390142) internal successors, (4454), 1237 states have internal predecessors, (4454), 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-15 20:33:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 4454 transitions. [2022-03-15 20:33:52,835 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 4454 transitions. Word has length 4 [2022-03-15 20:33:52,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:33:52,836 INFO L470 AbstractCegarLoop]: Abstraction has 1238 states and 4454 transitions. [2022-03-15 20:33:52,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-15 20:33:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 4454 transitions. [2022-03-15 20:33:52,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-03-15 20:33:52,837 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:33:52,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:33:52,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 20:33:52,838 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting fooErr0ASSERT_VIOLATIONASSERT === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT (and 2 more)] === [2022-03-15 20:33:52,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:33:52,838 INFO L85 PathProgramCache]: Analyzing trace with hash -335091953, now seen corresponding path program 1 times [2022-03-15 20:33:52,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:33:52,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607179591] [2022-03-15 20:33:52,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:33:52,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:33:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:33:52,895 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-15 20:33:52,895 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:33:52,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607179591] [2022-03-15 20:33:52,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607179591] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:33:52,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998999538] [2022-03-15 20:33:52,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:33:52,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:33:52,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:33:52,900 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-15 20:33:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:33:52,937 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-15 20:33:52,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 20:33:52,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:33:52,967 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-15 20:33:52,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:33:52,986 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-15 20:33:52,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998999538] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:33:52,986 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:33:52,986 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-03-15 20:33:52,986 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1137264265] [2022-03-15 20:33:52,987 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:33:52,987 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:33:52,987 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 11 transitions. [2022-03-15 20:33:52,987 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:33:52,997 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:33:52,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 20:33:52,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:33:52,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 20:33:52,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 20:33:52,998 INFO L87 Difference]: Start difference. First operand 1238 states and 4454 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:33:53,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:33:53,056 INFO L93 Difference]: Finished difference Result 1656 states and 5063 transitions. [2022-03-15 20:33:53,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 20:33:53,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-03-15 20:33:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:33:53,066 INFO L225 Difference]: With dead ends: 1656 [2022-03-15 20:33:53,067 INFO L226 Difference]: Without dead ends: 1628 [2022-03-15 20:33:53,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 20:33:53,069 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 35 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:33:53,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 16 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:33:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2022-03-15 20:33:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1458. [2022-03-15 20:33:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 1420 states have (on average 3.3309859154929575) internal successors, (4730), 1457 states have internal predecessors, (4730), 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-15 20:33:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 4730 transitions. [2022-03-15 20:33:53,122 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 4730 transitions. Word has length 7 [2022-03-15 20:33:53,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:33:53,122 INFO L470 AbstractCegarLoop]: Abstraction has 1458 states and 4730 transitions. [2022-03-15 20:33:53,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:33:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 4730 transitions. [2022-03-15 20:33:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:33:53,124 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:33:53,125 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:33:53,149 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-15 20:33:53,341 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,SelfDestructingSolverStorable8 [2022-03-15 20:33:53,342 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting fooErr0ASSERT_VIOLATIONASSERT === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, fooErr0ASSERT_VIOLATIONASSERT, fooErr0ASSERT_VIOLATIONASSERT (and 2 more)] === [2022-03-15 20:33:53,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:33:53,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1220562968, now seen corresponding path program 1 times [2022-03-15 20:33:53,343 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:33:53,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894399320] [2022-03-15 20:33:53,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:33:53,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:33:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:33:53,348 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 20:33:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:33:53,353 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 20:33:53,353 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 20:33:53,354 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location fooErr0ASSERT_VIOLATIONASSERT (5 of 6 remaining) [2022-03-15 20:33:53,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr0ASSERT_VIOLATIONASSERT (4 of 6 remaining) [2022-03-15 20:33:53,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-03-15 20:33:53,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr0ASSERT_VIOLATIONASSERT (2 of 6 remaining) [2022-03-15 20:33:53,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr0ASSERT_VIOLATIONASSERT (1 of 6 remaining) [2022-03-15 20:33:53,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr0ASSERT_VIOLATIONASSERT (0 of 6 remaining) [2022-03-15 20:33:53,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 20:33:53,355 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-03-15 20:33:53,362 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2022-03-15 20:33:53,362 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:33:53,374 INFO L202 PluginConnector]: Adding new model ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:33:53 BasicIcfg [2022-03-15 20:33:53,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:33:53,374 INFO L158 Benchmark]: Toolchain (without parser) took 2531.37ms. Allocated memory was 197.1MB in the beginning and 303.0MB in the end (delta: 105.9MB). Free memory was 153.7MB in the beginning and 201.8MB in the end (delta: -48.1MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. [2022-03-15 20:33:53,375 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 197.1MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:33:53,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.93ms. Allocated memory is still 197.1MB. Free memory was 153.7MB in the beginning and 152.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:33:53,375 INFO L158 Benchmark]: Boogie Preprocessor took 11.18ms. Allocated memory is still 197.1MB. Free memory was 152.1MB in the beginning and 151.2MB in the end (delta: 875.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:33:53,375 INFO L158 Benchmark]: RCFGBuilder took 151.94ms. Allocated memory is still 197.1MB. Free memory was 151.2MB in the beginning and 143.2MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-03-15 20:33:53,376 INFO L158 Benchmark]: TraceAbstraction took 2341.94ms. Allocated memory was 197.1MB in the beginning and 303.0MB in the end (delta: 105.9MB). Free memory was 142.7MB in the beginning and 201.8MB in the end (delta: -59.1MB). Peak memory consumption was 48.3MB. Max. memory is 8.0GB. [2022-03-15 20:33:53,377 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.12ms. Allocated memory is still 197.1MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.93ms. Allocated memory is still 197.1MB. Free memory was 153.7MB in the beginning and 152.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.18ms. Allocated memory is still 197.1MB. Free memory was 152.1MB in the beginning and 151.2MB in the end (delta: 875.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 151.94ms. Allocated memory is still 197.1MB. Free memory was 151.2MB in the beginning and 143.2MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 2341.94ms. Allocated memory was 197.1MB in the beginning and 303.0MB in the end (delta: 105.9MB). Free memory was 142.7MB in the beginning and 201.8MB in the end (delta: -59.1MB). Peak memory consumption was 48.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 13 PlacesBefore, 10 PlacesAfterwards, 10 TransitionsBefore, 7 TransitionsAfterwards, 24 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 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: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 20 PlacesBefore, 17 PlacesAfterwards, 15 TransitionsBefore, 12 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 119 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 88, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 88, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 52, unknown conditional: 0, unknown unconditional: 52] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - 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: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 23 PlacesAfterwards, 20 TransitionsBefore, 16 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 333 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 82, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 53, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 82, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 53, unknown conditional: 0, unknown unconditional: 53] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - 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: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 29 PlacesAfterwards, 25 TransitionsBefore, 20 TransitionsAfterwards, 336 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 624 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 155, positive: 121, positive conditional: 0, positive unconditional: 121, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 93, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 155, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 93, unknown conditional: 0, unknown unconditional: 93] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - 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: 31]: assertion can be violated assertion can be violated We found a FailurePath: [L17] 0 newid := 0; [L18] 0 n := 0; VAL [n=0, newid=0] [L21] FORK 0 fork newid foo(); VAL [n=0, newid=0] [L22] 0 newid := newid + 1; VAL [n=0, newid=1] [L30] 1 n := n + 1; VAL [n=1, newid=1] [L21] FORK 0 fork newid foo(); VAL [n=1, newid=1] [L30] 2 n := n + 1; VAL [n=2, newid=1] [L22] 0 newid := newid + 1; VAL [n=2, newid=2] [L21] FORK 0 fork newid foo(); VAL [n=2, newid=2] [L30] 3 n := n + 1; VAL [n=3, newid=2] [L31] 2 assert n <= 2; VAL [n=3, newid=2] - UnprovableResult [Line: 20]: 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, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 3 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred 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, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 2 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 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, 21 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 5 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, InterpolantAutomatonStates: 4, 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, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 26 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 12 mSDtfsCounter, 62 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=315occurred 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, 24 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 63 SizeOfPredicates, 0 NumberOfNonLiveVariables, 17 ConjunctsInSsa, 4 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, 31 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 89 IncrementalHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 14 mSDtfsCounter, 89 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=1458occurred in iteration=2, 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, 170 StatesRemovedByMinimization, 1 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, 63 SizeOfPredicates, 0 NumberOfNonLiveVariables, 17 ConjunctsInSsa, 4 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 RESULT: Ultimate proved your program to be incorrect! [2022-03-15 20:33:53,427 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...