/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 17:42:14,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 17:42:14,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 17:42:14,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 17:42:14,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 17:42:14,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 17:42:14,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 17:42:14,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 17:42:14,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 17:42:14,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 17:42:14,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 17:42:14,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 17:42:14,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 17:42:14,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 17:42:14,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 17:42:14,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 17:42:14,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 17:42:14,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 17:42:14,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 17:42:14,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 17:42:14,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 17:42:14,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 17:42:14,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 17:42:14,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 17:42:14,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 17:42:14,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 17:42:14,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 17:42:14,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 17:42:14,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 17:42:14,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 17:42:14,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 17:42:14,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 17:42:14,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 17:42:14,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 17:42:14,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 17:42:14,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 17:42:14,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 17:42:14,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 17:42:14,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 17:42:14,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 17:42:14,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 17:42:14,498 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-01 17:42:14,521 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 17:42:14,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 17:42:14,521 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 17:42:14,521 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 17:42:14,522 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 17:42:14,522 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 17:42:14,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 17:42:14,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 17:42:14,522 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 17:42:14,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 17:42:14,523 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 17:42:14,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 17:42:14,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 17:42:14,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 17:42:14,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 17:42:14,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 17:42:14,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 17:42:14,524 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 17:42:14,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 17:42:14,524 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 17:42:14,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 17:42:14,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 17:42:14,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 17:42:14,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 17:42:14,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 17:42:14,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 17:42:14,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 17:42:14,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 17:42:14,526 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 17:42:14,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 17:42:14,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 17:42:14,526 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 17:42:14,526 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 17:42:14,526 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-01 17:42:14,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 17:42:14,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 17:42:14,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 17:42:14,736 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-01 17:42:14,737 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-01 17:42:14,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl [2022-03-01 17:42:14,738 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl' [2022-03-01 17:42:14,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 17:42:14,760 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-01 17:42:14,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 17:42:14,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 17:42:14,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 17:42:14,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:42:14" (1/1) ... [2022-03-01 17:42:14,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:42:14" (1/1) ... [2022-03-01 17:42:14,778 INFO L137 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-01 17:42:14,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 17:42:14,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 17:42:14,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 17:42:14,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 17:42:14,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:42:14" (1/1) ... [2022-03-01 17:42:14,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:42:14" (1/1) ... [2022-03-01 17:42:14,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:42:14" (1/1) ... [2022-03-01 17:42:14,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:42:14" (1/1) ... [2022-03-01 17:42:14,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:42:14" (1/1) ... [2022-03-01 17:42:14,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:42:14" (1/1) ... [2022-03-01 17:42:14,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:42:14" (1/1) ... [2022-03-01 17:42:14,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 17:42:14,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 17:42:14,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 17:42:14,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 17:42:14,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:42:14" (1/1) ... [2022-03-01 17:42:14,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 17:42:14,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 17:42:14,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-01 17:42:14,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-01 17:42:14,844 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-01 17:42:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-01 17:42:14,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-01 17:42:14,844 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-01 17:42:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-01 17:42:14,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-01 17:42:14,844 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-01 17:42:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 17:42:14,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 17:42:14,845 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-01 17:42:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-01 17:42:14,845 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-01 17:42:14,845 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2022-03-01 17:42:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-01 17:42:14,845 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-01 17:42:14,845 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2022-03-01 17:42:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-03-01 17:42:14,846 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-03-01 17:42:14,846 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2022-03-01 17:42:14,846 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-03-01 17:42:14,846 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-03-01 17:42:14,847 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 17:42:14,887 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 17:42:14,888 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 17:42:15,025 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 17:42:15,034 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 17:42:15,035 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-01 17:42:15,036 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 05:42:15 BoogieIcfgContainer [2022-03-01 17:42:15,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 17:42:15,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 17:42:15,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 17:42:15,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 17:42:15,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.03 05:42:14" (1/2) ... [2022-03-01 17:42:15,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312cedab and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 05:42:15, skipping insertion in model container [2022-03-01 17:42:15,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 05:42:15" (2/2) ... [2022-03-01 17:42:15,050 INFO L111 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2022-03-01 17:42:15,053 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 17:42:15,053 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 17:42:15,053 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-01 17:42:15,053 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 17:42:15,130 INFO L148 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-03-01 17:42:15,178 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 17:42:15,182 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 17:42:15,183 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-03-01 17:42:15,202 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 73 transitions, 218 flow [2022-03-01 17:42:15,678 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10820 states, 10819 states have (on average 4.095295313799797) internal successors, (44307), 10819 states have internal predecessors, (44307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:15,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 10820 states, 10819 states have (on average 4.095295313799797) internal successors, (44307), 10819 states have internal predecessors, (44307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-01 17:42:15,795 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:42:15,795 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:42:15,796 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2022-03-01 17:42:15,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:42:15,800 INFO L85 PathProgramCache]: Analyzing trace with hash 513493419, now seen corresponding path program 1 times [2022-03-01 17:42:15,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:42:15,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376510387] [2022-03-01 17:42:15,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:42:15,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:42:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:42:15,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:42:15,941 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:42:15,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376510387] [2022-03-01 17:42:15,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376510387] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:42:15,942 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:42:15,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 17:42:15,944 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039502252] [2022-03-01 17:42:15,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:42:15,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 17:42:15,948 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:42:15,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 17:42:15,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:42:15,999 INFO L87 Difference]: Start difference. First operand has 10820 states, 10819 states have (on average 4.095295313799797) internal successors, (44307), 10819 states have internal predecessors, (44307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:42:16,236 INFO L93 Difference]: Finished difference Result 11214 states and 45854 transitions. [2022-03-01 17:42:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 17:42:16,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-01 17:42:16,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:42:16,322 INFO L225 Difference]: With dead ends: 11214 [2022-03-01 17:42:16,323 INFO L226 Difference]: Without dead ends: 11193 [2022-03-01 17:42:16,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:42:16,390 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 17:42:16,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 60 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 17:42:16,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11193 states. [2022-03-01 17:42:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11193 to 10962. [2022-03-01 17:42:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10962 states, 10961 states have (on average 4.090958854119149) internal successors, (44841), 10961 states have internal predecessors, (44841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10962 states to 10962 states and 44841 transitions. [2022-03-01 17:42:17,108 INFO L78 Accepts]: Start accepts. Automaton has 10962 states and 44841 transitions. Word has length 23 [2022-03-01 17:42:17,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:42:17,109 INFO L470 AbstractCegarLoop]: Abstraction has 10962 states and 44841 transitions. [2022-03-01 17:42:17,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:17,109 INFO L276 IsEmpty]: Start isEmpty. Operand 10962 states and 44841 transitions. [2022-03-01 17:42:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-01 17:42:17,150 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:42:17,150 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:42:17,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 17:42:17,151 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2022-03-01 17:42:17,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:42:17,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2098976562, now seen corresponding path program 1 times [2022-03-01 17:42:17,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:42:17,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020631909] [2022-03-01 17:42:17,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:42:17,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:42:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:42:17,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:42:17,208 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:42:17,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020631909] [2022-03-01 17:42:17,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020631909] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:42:17,209 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:42:17,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 17:42:17,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423360718] [2022-03-01 17:42:17,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:42:17,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 17:42:17,210 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:42:17,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 17:42:17,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:42:17,211 INFO L87 Difference]: Start difference. First operand 10962 states and 44841 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:42:17,470 INFO L93 Difference]: Finished difference Result 13038 states and 52625 transitions. [2022-03-01 17:42:17,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 17:42:17,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-01 17:42:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:42:17,535 INFO L225 Difference]: With dead ends: 13038 [2022-03-01 17:42:17,535 INFO L226 Difference]: Without dead ends: 12721 [2022-03-01 17:42:17,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:42:17,541 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 47 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:42:17,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 97 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 17:42:17,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12721 states. [2022-03-01 17:42:17,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12721 to 11889. [2022-03-01 17:42:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11889 states, 11888 states have (on average 4.034909152086137) internal successors, (47967), 11888 states have internal predecessors, (47967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11889 states to 11889 states and 47967 transitions. [2022-03-01 17:42:18,032 INFO L78 Accepts]: Start accepts. Automaton has 11889 states and 47967 transitions. Word has length 31 [2022-03-01 17:42:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:42:18,032 INFO L470 AbstractCegarLoop]: Abstraction has 11889 states and 47967 transitions. [2022-03-01 17:42:18,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 11889 states and 47967 transitions. [2022-03-01 17:42:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-01 17:42:18,066 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:42:18,067 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:42:18,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 17:42:18,067 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2022-03-01 17:42:18,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:42:18,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2052651792, now seen corresponding path program 1 times [2022-03-01 17:42:18,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:42:18,070 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288852846] [2022-03-01 17:42:18,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:42:18,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:42:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:42:18,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:42:18,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:42:18,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288852846] [2022-03-01 17:42:18,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288852846] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:42:18,115 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:42:18,115 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 17:42:18,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922453890] [2022-03-01 17:42:18,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:42:18,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 17:42:18,116 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:42:18,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 17:42:18,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:42:18,117 INFO L87 Difference]: Start difference. First operand 11889 states and 47967 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:42:18,226 INFO L93 Difference]: Finished difference Result 11681 states and 45149 transitions. [2022-03-01 17:42:18,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 17:42:18,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-01 17:42:18,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:42:18,345 INFO L225 Difference]: With dead ends: 11681 [2022-03-01 17:42:18,345 INFO L226 Difference]: Without dead ends: 9378 [2022-03-01 17:42:18,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:42:18,351 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 44 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:42:18,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 96 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 17:42:18,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9378 states. [2022-03-01 17:42:18,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9378 to 9378. [2022-03-01 17:42:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9378 states, 9377 states have (on average 3.84099392129679) internal successors, (36017), 9377 states have internal predecessors, (36017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9378 states to 9378 states and 36017 transitions. [2022-03-01 17:42:18,645 INFO L78 Accepts]: Start accepts. Automaton has 9378 states and 36017 transitions. Word has length 31 [2022-03-01 17:42:18,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:42:18,645 INFO L470 AbstractCegarLoop]: Abstraction has 9378 states and 36017 transitions. [2022-03-01 17:42:18,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 9378 states and 36017 transitions. [2022-03-01 17:42:18,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-01 17:42:18,665 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:42:18,665 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:42:18,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 17:42:18,666 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2022-03-01 17:42:18,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:42:18,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1264094886, now seen corresponding path program 1 times [2022-03-01 17:42:18,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:42:18,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024471397] [2022-03-01 17:42:18,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:42:18,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:42:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:42:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:42:18,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:42:18,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024471397] [2022-03-01 17:42:18,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024471397] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:42:18,693 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:42:18,693 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 17:42:18,693 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682626500] [2022-03-01 17:42:18,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:42:18,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 17:42:18,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:42:18,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 17:42:18,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:42:18,695 INFO L87 Difference]: Start difference. First operand 9378 states and 36017 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:42:18,773 INFO L93 Difference]: Finished difference Result 11158 states and 41887 transitions. [2022-03-01 17:42:18,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 17:42:18,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-01 17:42:18,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:42:18,810 INFO L225 Difference]: With dead ends: 11158 [2022-03-01 17:42:18,810 INFO L226 Difference]: Without dead ends: 10600 [2022-03-01 17:42:18,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:42:18,814 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 38 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:42:18,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 97 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 17:42:18,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10600 states. [2022-03-01 17:42:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10600 to 10244. [2022-03-01 17:42:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10244 states, 10243 states have (on average 3.7574929219955093) internal successors, (38488), 10243 states have internal predecessors, (38488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 38488 transitions. [2022-03-01 17:42:19,108 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 38488 transitions. Word has length 31 [2022-03-01 17:42:19,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:42:19,109 INFO L470 AbstractCegarLoop]: Abstraction has 10244 states and 38488 transitions. [2022-03-01 17:42:19,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:19,109 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 38488 transitions. [2022-03-01 17:42:19,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-01 17:42:19,127 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:42:19,127 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:42:19,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-01 17:42:19,127 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2022-03-01 17:42:19,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:42:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash 550542672, now seen corresponding path program 1 times [2022-03-01 17:42:19,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:42:19,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818879677] [2022-03-01 17:42:19,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:42:19,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:42:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:42:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:42:19,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:42:19,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818879677] [2022-03-01 17:42:19,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818879677] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:42:19,162 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:42:19,162 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 17:42:19,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862408671] [2022-03-01 17:42:19,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:42:19,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 17:42:19,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:42:19,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 17:42:19,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:42:19,163 INFO L87 Difference]: Start difference. First operand 10244 states and 38488 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:42:19,233 INFO L93 Difference]: Finished difference Result 9700 states and 34735 transitions. [2022-03-01 17:42:19,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 17:42:19,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-01 17:42:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:42:19,263 INFO L225 Difference]: With dead ends: 9700 [2022-03-01 17:42:19,263 INFO L226 Difference]: Without dead ends: 8001 [2022-03-01 17:42:19,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:42:19,277 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 37 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:42:19,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 96 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 17:42:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states. [2022-03-01 17:42:19,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8001 to 8001. [2022-03-01 17:42:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8001 states, 8000 states have (on average 3.590375) internal successors, (28723), 8000 states have internal predecessors, (28723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8001 states to 8001 states and 28723 transitions. [2022-03-01 17:42:19,538 INFO L78 Accepts]: Start accepts. Automaton has 8001 states and 28723 transitions. Word has length 31 [2022-03-01 17:42:19,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:42:19,538 INFO L470 AbstractCegarLoop]: Abstraction has 8001 states and 28723 transitions. [2022-03-01 17:42:19,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 8001 states and 28723 transitions. [2022-03-01 17:42:19,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-01 17:42:19,555 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:42:19,555 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:42:19,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-01 17:42:19,555 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2022-03-01 17:42:19,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:42:19,559 INFO L85 PathProgramCache]: Analyzing trace with hash 48999775, now seen corresponding path program 1 times [2022-03-01 17:42:19,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:42:19,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311585116] [2022-03-01 17:42:19,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:42:19,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:42:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 17:42:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 17:42:19,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 17:42:19,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311585116] [2022-03-01 17:42:19,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311585116] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 17:42:19,604 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 17:42:19,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 17:42:19,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314332367] [2022-03-01 17:42:19,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 17:42:19,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 17:42:19,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:42:19,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 17:42:19,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:42:19,606 INFO L87 Difference]: Start difference. First operand 8001 states and 28723 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:19,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 17:42:19,672 INFO L93 Difference]: Finished difference Result 6666 states and 23386 transitions. [2022-03-01 17:42:19,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 17:42:19,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 39 [2022-03-01 17:42:19,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 17:42:19,693 INFO L225 Difference]: With dead ends: 6666 [2022-03-01 17:42:19,693 INFO L226 Difference]: Without dead ends: 6666 [2022-03-01 17:42:19,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 17:42:19,695 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 32 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:42:19,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 96 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 17:42:19,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6666 states. [2022-03-01 17:42:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6666 to 6666. [2022-03-01 17:42:19,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6666 states, 6665 states have (on average 3.508777194298575) internal successors, (23386), 6665 states have internal predecessors, (23386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 23386 transitions. [2022-03-01 17:42:19,930 INFO L78 Accepts]: Start accepts. Automaton has 6666 states and 23386 transitions. Word has length 39 [2022-03-01 17:42:19,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 17:42:19,931 INFO L470 AbstractCegarLoop]: Abstraction has 6666 states and 23386 transitions. [2022-03-01 17:42:19,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:42:19,931 INFO L276 IsEmpty]: Start isEmpty. Operand 6666 states and 23386 transitions. [2022-03-01 17:42:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-01 17:42:19,943 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 17:42:19,943 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:42:19,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-01 17:42:19,943 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2022-03-01 17:42:19,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 17:42:19,943 INFO L85 PathProgramCache]: Analyzing trace with hash 938050459, now seen corresponding path program 2 times [2022-03-01 17:42:19,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 17:42:19,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792232784] [2022-03-01 17:42:19,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 17:42:19,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 17:42:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 17:42:19,952 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-01 17:42:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 17:42:19,979 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-01 17:42:19,979 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-01 17:42:19,980 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (10 of 11 remaining) [2022-03-01 17:42:19,982 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0INUSE_VIOLATION (9 of 11 remaining) [2022-03-01 17:42:19,982 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7INUSE_VIOLATION (8 of 11 remaining) [2022-03-01 17:42:19,982 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8INUSE_VIOLATION (7 of 11 remaining) [2022-03-01 17:42:19,982 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9INUSE_VIOLATION (6 of 11 remaining) [2022-03-01 17:42:19,982 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3INUSE_VIOLATION (5 of 11 remaining) [2022-03-01 17:42:19,982 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err5INUSE_VIOLATION (4 of 11 remaining) [2022-03-01 17:42:19,982 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork2Err1INUSE_VIOLATION (3 of 11 remaining) [2022-03-01 17:42:19,983 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork2Err2INUSE_VIOLATION (2 of 11 remaining) [2022-03-01 17:42:19,983 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork3Err4INUSE_VIOLATION (1 of 11 remaining) [2022-03-01 17:42:19,983 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork3Err6INUSE_VIOLATION (0 of 11 remaining) [2022-03-01 17:42:19,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-01 17:42:19,985 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-03-01 17:42:19,988 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-01 17:42:19,988 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-01 17:42:20,003 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.03 05:42:20 BasicIcfg [2022-03-01 17:42:20,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-01 17:42:20,004 INFO L158 Benchmark]: Toolchain (without parser) took 5243.74ms. Allocated memory was 197.1MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 157.2MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 376.1MB. Max. memory is 8.0GB. [2022-03-01 17:42:20,004 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 17:42:20,004 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.16ms. Allocated memory is still 197.1MB. Free memory was 157.1MB in the beginning and 155.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-01 17:42:20,004 INFO L158 Benchmark]: Boogie Preprocessor took 11.70ms. Allocated memory is still 197.1MB. Free memory was 155.5MB in the beginning and 154.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-01 17:42:20,004 INFO L158 Benchmark]: RCFGBuilder took 244.65ms. Allocated memory is still 197.1MB. Free memory was 154.5MB in the beginning and 144.4MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-01 17:42:20,005 INFO L158 Benchmark]: TraceAbstraction took 4961.76ms. Allocated memory was 197.1MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 143.9MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 362.4MB. Max. memory is 8.0GB. [2022-03-01 17:42:20,005 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.11ms. Allocated memory is still 197.1MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.16ms. Allocated memory is still 197.1MB. Free memory was 157.1MB in the beginning and 155.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.70ms. Allocated memory is still 197.1MB. Free memory was 155.5MB in the beginning and 154.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 244.65ms. Allocated memory is still 197.1MB. Free memory was 154.5MB in the beginning and 144.4MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4961.76ms. Allocated memory was 197.1MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 143.9MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 362.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 121]: assertion can be violated assertion can be violated We found a FailurePath: [L115] 0 assume x_0 == x_8 && y_1 == y_9; VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L116] FORK 0 fork 1 thread1(); VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L60] 1 f1_2 := false; [L61] 1 f2_3 := false; VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L117] FORK 0 fork 4, 4, 4, 4 thread4(); VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L103] 2 f1_10 := false; [L104] 2 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L106] FORK 2 fork 5, 5, 5, 5, 5 thread5(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L73] 3 temp_12 := x_8; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L74] 3 x_8 := temp_12 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L75] 3 f1_10 := true; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L107] FORK 2 fork 6, 6, 6, 6, 6, 6 thread6(); VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L88] 4 temp_14 := y_9; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L89] 4 y_9 := temp_14 + 1; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0] [L90] 4 f2_11 := true; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0] [L76] 3 assume f2_11; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0] [L77] 3 temp_13 := y_9; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0] [L78] 3 y_9 := temp_13 + 1; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=1] [L91] 4 assume f1_10; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=1] [L79] 3 f1_10 := false; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=1] [L92] 4 temp_15 := x_8; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=0, y_1=-1, y_9=1] [L93] 4 x_8 := temp_15 + 1; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L94] 4 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L95] 4 assume !f1_10; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L80] 3 assume !f2_11; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L108] JOIN 3 join 5, 5, 5, 5, 5; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L109] JOIN 4 join 6, 6, 6, 6, 6, 6; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L63] FORK 1 fork 2, 2 thread2(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L64] FORK 1 fork 3, 3, 3 thread3(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L65] JOIN 5 join 2, 2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L66] JOIN 6 join 3, 3, 3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L118] JOIN 1 join 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L119] JOIN 2 join 4, 4, 4, 4; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L120] 0 assume !(x_0 == x_8 && y_1 == y_9); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L121] 0 assert false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] - UnprovableResult [Line: 63]: 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. - UnprovableResult [Line: 59]: 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. - UnprovableResult [Line: 116]: 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. - UnprovableResult [Line: 116]: 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. - UnprovableResult [Line: 106]: 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. - UnprovableResult [Line: 102]: 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. - UnprovableResult [Line: 59]: 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. - UnprovableResult [Line: 63]: 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. - UnprovableResult [Line: 102]: 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. - UnprovableResult [Line: 106]: 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 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 206 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 206 mSDsluCounter, 542 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 251 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 261 IncrementalHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 367 mSDtfsCounter, 261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11889occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 1419 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-03-01 17:42:20,031 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...