/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-POR-NewStatesSleep-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-820ea7a [2022-02-18 22:29:19,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-18 22:29:19,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-18 22:29:19,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-18 22:29:19,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-18 22:29:19,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-18 22:29:19,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-18 22:29:19,448 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-18 22:29:19,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-18 22:29:19,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-18 22:29:19,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-18 22:29:19,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-18 22:29:19,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-18 22:29:19,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-18 22:29:19,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-18 22:29:19,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-18 22:29:19,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-18 22:29:19,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-18 22:29:19,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-18 22:29:19,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-18 22:29:19,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-18 22:29:19,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-18 22:29:19,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-18 22:29:19,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-18 22:29:19,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-18 22:29:19,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-18 22:29:19,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-18 22:29:19,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-18 22:29:19,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-18 22:29:19,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-18 22:29:19,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-18 22:29:19,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-18 22:29:19,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-18 22:29:19,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-18 22:29:19,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-18 22:29:19,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-18 22:29:19,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-18 22:29:19,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-18 22:29:19,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-18 22:29:19,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-18 22:29:19,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-18 22:29:19,478 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-POR-NewStatesSleep-NoLbe.epf [2022-02-18 22:29:19,496 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-18 22:29:19,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-18 22:29:19,496 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-18 22:29:19,496 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-18 22:29:19,497 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-18 22:29:19,497 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-18 22:29:19,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-18 22:29:19,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-18 22:29:19,498 INFO L138 SettingsManager]: * Use SBE=true [2022-02-18 22:29:19,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-18 22:29:19,498 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-18 22:29:19,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-18 22:29:19,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-18 22:29:19,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-18 22:29:19,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-18 22:29:19,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-18 22:29:19,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-18 22:29:19,499 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-18 22:29:19,499 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-18 22:29:19,499 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-18 22:29:19,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-18 22:29:19,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-18 22:29:19,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-18 22:29:19,500 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-18 22:29:19,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-18 22:29:19,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-18 22:29:19,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-18 22:29:19,501 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-02-18 22:29:19,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-18 22:29:19,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-18 22:29:19,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-18 22:29:19,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-18 22:29:19,502 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-18 22:29:19,502 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-18 22:29:19,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-18 22:29:19,502 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-02-18 22:29:19,502 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-02-18 22:29:19,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-18 22:29:19,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-18 22:29:19,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-18 22:29:19,706 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-02-18 22:29:19,709 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-02-18 22:29:19,710 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-02-18 22:29:19,710 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl' [2022-02-18 22:29:19,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-18 22:29:19,738 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-18 22:29:19,739 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-18 22:29:19,739 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-18 22:29:19,739 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-18 22:29:19,748 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 18.02 10:29:19" (1/1) ... [2022-02-18 22:29:19,753 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 18.02 10:29:19" (1/1) ... [2022-02-18 22:29:19,757 INFO L137 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-02-18 22:29:19,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-18 22:29:19,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-18 22:29:19,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-18 22:29:19,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-18 22:29:19,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:29:19" (1/1) ... [2022-02-18 22:29:19,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:29:19" (1/1) ... [2022-02-18 22:29:19,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:29:19" (1/1) ... [2022-02-18 22:29:19,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:29:19" (1/1) ... [2022-02-18 22:29:19,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:29:19" (1/1) ... [2022-02-18 22:29:19,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:29:19" (1/1) ... [2022-02-18 22:29:19,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:29:19" (1/1) ... [2022-02-18 22:29:19,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-18 22:29:19,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-18 22:29:19,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-18 22:29:19,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-18 22:29:19,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:29:19" (1/1) ... [2022-02-18 22:29:19,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-18 22:29:19,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 22:29:19,793 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-02-18 22:29:19,799 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-02-18 22:29:19,831 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-02-18 22:29:19,831 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-18 22:29:19,831 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-18 22:29:19,831 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-02-18 22:29:19,831 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-18 22:29:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-18 22:29:19,832 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-02-18 22:29:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-18 22:29:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-18 22:29:19,832 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-02-18 22:29:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-02-18 22:29:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-02-18 22:29:19,832 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2022-02-18 22:29:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-02-18 22:29:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-02-18 22:29:19,832 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2022-02-18 22:29:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-02-18 22:29:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-02-18 22:29:19,834 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2022-02-18 22:29:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-02-18 22:29:19,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-02-18 22:29:19,835 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-18 22:29:19,892 INFO L234 CfgBuilder]: Building ICFG [2022-02-18 22:29:19,893 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-18 22:29:20,044 INFO L275 CfgBuilder]: Performing block encoding [2022-02-18 22:29:20,053 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-18 22:29:20,053 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-18 22:29:20,055 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 10:29:20 BoogieIcfgContainer [2022-02-18 22:29:20,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-18 22:29:20,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-18 22:29:20,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-18 22:29:20,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-18 22:29:20,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:29:19" (1/2) ... [2022-02-18 22:29:20,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee8bb31 and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 10:29:20, skipping insertion in model container [2022-02-18 22:29:20,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 10:29:20" (2/2) ... [2022-02-18 22:29:20,090 INFO L111 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2022-02-18 22:29:20,093 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-18 22:29:20,093 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-18 22:29:20,093 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-18 22:29:20,093 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-18 22:29:20,192 INFO L148 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-02-18 22:29:20,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-18 22:29:20,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 22:29:20,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-18 22:29:20,276 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-18 22:29:20,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-02-18 22:29:20,286 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=PARTIAL_ORDER_FA, mLazyFiniteAutomaton=true, 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-02-18 22:29:20,286 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-02-18 22:29:20,721 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2022-02-18 22:29:20,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 22:29:20,729 INFO L85 PathProgramCache]: Analyzing trace with hash -963017113, now seen corresponding path program 1 times [2022-02-18 22:29:20,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 22:29:20,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565933286] [2022-02-18 22:29:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 22:29:20,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 22:29:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 22:29:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2022-02-18 22:29:20,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 22:29:20,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565933286] [2022-02-18 22:29:20,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565933286] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 22:29:20,902 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 22:29:20,903 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-18 22:29:20,904 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303344766] [2022-02-18 22:29:20,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 22:29:20,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-18 22:29:20,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 22:29:20,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-18 22:29:20,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-18 22:29:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-18 22:29:20,924 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-18 22:29:20,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-02-18 22:29:20,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-18 22:29:21,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-18 22:29:21,183 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2022-02-18 22:29:21,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 22:29:21,186 INFO L85 PathProgramCache]: Analyzing trace with hash 143439142, now seen corresponding path program 2 times [2022-02-18 22:29:21,186 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 22:29:21,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775339986] [2022-02-18 22:29:21,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 22:29:21,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 22:29:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 22:29:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-02-18 22:29:21,333 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 22:29:21,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775339986] [2022-02-18 22:29:21,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775339986] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 22:29:21,333 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 22:29:21,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-18 22:29:21,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375061354] [2022-02-18 22:29:21,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 22:29:21,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-18 22:29:21,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 22:29:21,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-18 22:29:21,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-18 22:29:21,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-18 22:29:21,338 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-18 22:29:21,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-02-18 22:29:21,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-18 22:29:21,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-18 22:29:21,556 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2022-02-18 22:29:21,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 22:29:21,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1271555551, now seen corresponding path program 3 times [2022-02-18 22:29:21,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 22:29:21,558 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141545789] [2022-02-18 22:29:21,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 22:29:21,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 22:29:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 22:29:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-02-18 22:29:21,596 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 22:29:21,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141545789] [2022-02-18 22:29:21,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141545789] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 22:29:21,597 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 22:29:21,597 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-18 22:29:21,597 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589831337] [2022-02-18 22:29:21,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 22:29:21,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-18 22:29:21,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 22:29:21,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-18 22:29:21,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-18 22:29:21,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-18 22:29:21,598 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-18 22:29:21,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-02-18 22:29:21,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-18 22:29:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-18 22:29:21,744 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2022-02-18 22:29:21,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 22:29:21,745 INFO L85 PathProgramCache]: Analyzing trace with hash -419172420, now seen corresponding path program 4 times [2022-02-18 22:29:21,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 22:29:21,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627275735] [2022-02-18 22:29:21,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 22:29:21,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 22:29:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 22:29:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-02-18 22:29:21,800 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 22:29:21,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627275735] [2022-02-18 22:29:21,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627275735] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 22:29:21,802 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 22:29:21,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-18 22:29:21,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608932218] [2022-02-18 22:29:21,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 22:29:21,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-18 22:29:21,803 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 22:29:21,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-18 22:29:21,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-18 22:29:21,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-18 22:29:21,807 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-18 22:29:21,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-02-18 22:29:21,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-18 22:29:21,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-18 22:29:21,846 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2022-02-18 22:29:21,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 22:29:21,846 INFO L85 PathProgramCache]: Analyzing trace with hash -810421189, now seen corresponding path program 5 times [2022-02-18 22:29:21,846 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 22:29:21,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160146201] [2022-02-18 22:29:21,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 22:29:21,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 22:29:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 22:29:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-18 22:29:21,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 22:29:21,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160146201] [2022-02-18 22:29:21,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160146201] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 22:29:21,889 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 22:29:21,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-18 22:29:21,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303445237] [2022-02-18 22:29:21,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 22:29:21,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-18 22:29:21,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 22:29:21,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-18 22:29:21,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-18 22:29:21,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-18 22:29:21,891 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-18 22:29:21,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-02-18 22:29:21,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-18 22:29:21,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-18 22:29:21,930 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2022-02-18 22:29:21,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 22:29:21,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1250660342, now seen corresponding path program 6 times [2022-02-18 22:29:21,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 22:29:21,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181962426] [2022-02-18 22:29:21,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 22:29:21,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 22:29:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 22:29:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-18 22:29:21,971 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 22:29:21,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181962426] [2022-02-18 22:29:21,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181962426] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 22:29:21,972 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 22:29:21,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-18 22:29:21,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075465207] [2022-02-18 22:29:21,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 22:29:21,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-18 22:29:21,973 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 22:29:21,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-18 22:29:21,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-18 22:29:21,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-18 22:29:21,974 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-18 22:29:21,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-02-18 22:29:21,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:21,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-18 22:29:22,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:22,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:22,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:22,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:22,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:22,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:22,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-18 22:29:22,005 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2022-02-18 22:29:22,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 22:29:22,006 INFO L85 PathProgramCache]: Analyzing trace with hash -79880111, now seen corresponding path program 7 times [2022-02-18 22:29:22,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 22:29:22,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639829] [2022-02-18 22:29:22,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 22:29:22,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 22:29:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 22:29:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 22:29:22,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 22:29:22,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639829] [2022-02-18 22:29:22,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639829] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-18 22:29:22,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578226776] [2022-02-18 22:29:22,398 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-18 22:29:22,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-18 22:29:22,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 22:29:22,399 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-02-18 22:29:22,400 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-02-18 22:29:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 22:29:22,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-18 22:29:22,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-18 22:29:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 22:29:22,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-18 22:29:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 22:29:23,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578226776] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-18 22:29:23,184 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-18 22:29:23,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2022-02-18 22:29:23,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993555445] [2022-02-18 22:29:23,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-18 22:29:23,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-18 22:29:23,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 22:29:23,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-18 22:29:23,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-02-18 22:29:23,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-18 22:29:23,186 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-18 22:29:23,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 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-02-18 22:29:23,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:23,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:23,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:23,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:23,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:23,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:23,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-18 22:29:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 22:29:23,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-18 22:29:23,685 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-02-18 22:29:23,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-02-18 22:29:23,864 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] === [2022-02-18 22:29:23,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 22:29:23,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1428257903, now seen corresponding path program 8 times [2022-02-18 22:29:23,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 22:29:23,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941304168] [2022-02-18 22:29:23,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 22:29:23,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 22:29:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-18 22:29:23,874 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-18 22:29:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-18 22:29:23,897 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-18 22:29:23,897 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-18 22:29:23,897 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (10 of 11 remaining) [2022-02-18 22:29:23,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0INUSE_VIOLATION (9 of 11 remaining) [2022-02-18 22:29:23,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7INUSE_VIOLATION (8 of 11 remaining) [2022-02-18 22:29:23,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8INUSE_VIOLATION (7 of 11 remaining) [2022-02-18 22:29:23,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9INUSE_VIOLATION (6 of 11 remaining) [2022-02-18 22:29:23,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3INUSE_VIOLATION (5 of 11 remaining) [2022-02-18 22:29:23,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err5INUSE_VIOLATION (4 of 11 remaining) [2022-02-18 22:29:23,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork2Err1INUSE_VIOLATION (3 of 11 remaining) [2022-02-18 22:29:23,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork2Err2INUSE_VIOLATION (2 of 11 remaining) [2022-02-18 22:29:23,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork3Err4INUSE_VIOLATION (1 of 11 remaining) [2022-02-18 22:29:23,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork3Err6INUSE_VIOLATION (0 of 11 remaining) [2022-02-18 22:29:23,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-18 22:29:23,905 INFO L732 BasicCegarLoop]: Path program histogram: [8] [2022-02-18 22:29:23,907 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-18 22:29:23,907 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-18 22:29:23,932 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 10:29:23 BasicIcfg [2022-02-18 22:29:23,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-18 22:29:23,933 INFO L158 Benchmark]: Toolchain (without parser) took 4194.08ms. Allocated memory was 182.5MB in the beginning and 354.4MB in the end (delta: 172.0MB). Free memory was 142.1MB in the beginning and 290.0MB in the end (delta: -147.8MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-02-18 22:29:23,933 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-18 22:29:23,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.27ms. Allocated memory is still 182.5MB. Free memory was 142.1MB in the beginning and 140.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-18 22:29:23,933 INFO L158 Benchmark]: Boogie Preprocessor took 12.32ms. Allocated memory is still 182.5MB. Free memory was 140.5MB in the beginning and 139.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-18 22:29:23,933 INFO L158 Benchmark]: RCFGBuilder took 282.62ms. Allocated memory is still 182.5MB. Free memory was 139.4MB in the beginning and 128.8MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-02-18 22:29:23,934 INFO L158 Benchmark]: TraceAbstraction took 3876.22ms. Allocated memory was 182.5MB in the beginning and 354.4MB in the end (delta: 172.0MB). Free memory was 128.3MB in the beginning and 290.0MB in the end (delta: -161.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-02-18 22:29:23,935 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.09ms. Allocated memory is still 182.5MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.27ms. Allocated memory is still 182.5MB. Free memory was 142.1MB in the beginning and 140.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.32ms. Allocated memory is still 182.5MB. Free memory was 140.5MB in the beginning and 139.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 282.62ms. Allocated memory is still 182.5MB. Free memory was 139.4MB in the beginning and 128.8MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3876.22ms. Allocated memory was 182.5MB in the beginning and 354.4MB in the end (delta: 172.0MB). Free memory was 128.3MB in the beginning and 290.0MB in the end (delta: -161.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 61066, positive: 54637, positive conditional: 54637, positive unconditional: 0, negative: 6429, negative conditional: 6429, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55912, positive: 54637, positive conditional: 54637, positive unconditional: 0, negative: 1275, negative conditional: 1275, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 55912, positive: 54637, positive conditional: 54637, positive unconditional: 0, negative: 1275, negative conditional: 1275, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57354, positive: 54637, positive conditional: 39119, positive unconditional: 15518, negative: 2717, negative conditional: 1442, negative unconditional: 1275, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57354, positive: 54637, positive conditional: 5440, positive unconditional: 49197, negative: 2717, negative conditional: 44, negative unconditional: 2673, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57354, positive: 54637, positive conditional: 5440, positive unconditional: 49197, negative: 2717, negative conditional: 44, negative unconditional: 2673, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 760, positive: 734, positive conditional: 49, positive unconditional: 685, negative: 26, negative conditional: 6, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 760, positive: 724, positive conditional: 0, positive unconditional: 724, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 10, positive conditional: 3, positive unconditional: 7, negative: 26, negative conditional: 6, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, positive: 8, positive conditional: 2, positive unconditional: 6, negative: 66, negative conditional: 6, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57354, positive: 53903, positive conditional: 5391, positive unconditional: 48512, negative: 2691, negative conditional: 38, negative unconditional: 2653, unknown: 760, unknown conditional: 55, unknown unconditional: 705] , Statistics on independence cache: Total cache size (in pairs): 760, Positive cache size: 734, Positive conditional cache size: 49, Positive unconditional cache size: 685, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Eliminated conditions: 35077, Maximal queried relation: 5, Independence queries for same thread: 5154 - 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] [L63] FORK 1 fork 2, 2 thread2(); 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] [L64] FORK 1 fork 3, 3, 3 thread3(); 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] [L107] FORK 2 fork 6, 6, 6, 6, 6, 6 thread6(); 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] [L30] 3 temp_4 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L31] 3 x_0 := temp_4 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L32] 3 f1_2 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L45] 4 temp_6 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=-1, y_9=-1] [L46] 4 y_1 := temp_6 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L47] 4 f2_3 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L33] 3 assume f2_3; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L34] 3 temp_5 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, x_0=0, x_8=-1, y_1=0, y_9=-1] [L35] 3 y_1 := temp_5 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, x_0=0, x_8=-1, y_1=1, y_9=-1] [L48] 4 assume f1_2; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, x_0=0, x_8=-1, y_1=1, y_9=-1] [L36] 3 f1_2 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, x_0=0, x_8=-1, y_1=1, y_9=-1] [L49] 4 temp_7 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=0, x_8=-1, y_1=1, y_9=-1] [L50] 4 x_0 := temp_7 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L51] 4 f2_3 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L37] 3 assume !f2_3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L30] 3 temp_4 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1] [L31] 3 x_0 := temp_4 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=-1, temp_7=0, x_0=2, x_8=-1, y_1=1, y_9=-1] [L52] 4 assume !f1_2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=-1, temp_7=0, x_0=2, x_8=-1, y_1=1, y_9=-1] [L32] 3 f1_2 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=-1, temp_7=0, x_0=2, x_8=-1, y_1=1, y_9=-1] [L45] 4 temp_6 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=1, y_9=-1] [L46] 4 y_1 := temp_6 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=1, temp_5=0, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=2, y_9=-1] [L47] 4 f2_3 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=1, temp_5=0, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=2, y_9=-1] [L33] 3 assume f2_3; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=1, temp_5=0, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=2, y_9=-1] [L34] 3 temp_5 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=2, y_9=-1] [L35] 3 y_1 := temp_5 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=3, y_9=-1] [L48] 4 assume f1_2; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=3, y_9=-1] [L36] 3 f1_2 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=0, x_0=2, x_8=-1, y_1=3, y_9=-1] [L49] 4 temp_7 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=2, x_8=-1, y_1=3, y_9=-1] [L50] 4 x_0 := temp_7 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=-1, y_1=3, y_9=-1] [L51] 4 f2_3 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=-1, y_1=3, y_9=-1] [L37] 3 assume !f2_3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=-1, y_1=3, y_9=-1] [L52] 4 assume !f1_2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=-1, y_1=3, y_9=-1] [L73] 5 temp_12 := x_8; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=-1, y_1=3, y_9=-1] [L74] 5 x_8 := temp_12 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=-1] [L75] 5 f1_10 := true; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=-1] [L88] 6 temp_14 := y_9; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=-1] [L89] 6 y_9 := temp_14 + 1; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=0] [L90] 6 f2_11 := true; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=0] [L76] 5 assume f2_11; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_14=-1, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=0] [L77] 5 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, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=0] [L78] 5 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, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=1] [L91] 6 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, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=1] [L79] 5 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, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=1] [L92] 6 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, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=0, y_1=3, y_9=1] [L93] 6 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, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L94] 6 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, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L80] 5 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, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L95] 6 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, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L65] JOIN 3 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, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L66] JOIN 4 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, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, 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, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L108] JOIN 5 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, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, y_9=1] [L109] JOIN 6 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, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, 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, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, 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, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, 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, temp_4=1, temp_5=2, temp_6=1, temp_7=2, x_0=3, x_8=1, y_1=3, 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: 3.7s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 1.6s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 871 NumberOfCodeBlocks, 871 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 846 ConstructedInterpolants, 0 QuantifiedInterpolants, 2924 SizeOfPredicates, 16 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 885/897 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-02-18 22:29:23,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-02-18 22:29:24,193 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...