/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-NewStatesSleepUncond-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.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747
[2021-08-22 11:53:26,040 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-08-22 11:53:26,041 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-08-22 11:53:26,065 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-08-22 11:53:26,066 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-08-22 11:53:26,067 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-08-22 11:53:26,068 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-08-22 11:53:26,070 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-08-22 11:53:26,071 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-08-22 11:53:26,072 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-08-22 11:53:26,073 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-08-22 11:53:26,074 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-08-22 11:53:26,074 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-08-22 11:53:26,076 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-08-22 11:53:26,077 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-08-22 11:53:26,078 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-08-22 11:53:26,078 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-08-22 11:53:26,079 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-08-22 11:53:26,081 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-08-22 11:53:26,082 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-08-22 11:53:26,083 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-08-22 11:53:26,085 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-08-22 11:53:26,086 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-08-22 11:53:26,087 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-08-22 11:53:26,089 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-08-22 11:53:26,090 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-08-22 11:53:26,090 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-08-22 11:53:26,091 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-08-22 11:53:26,091 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-08-22 11:53:26,092 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-08-22 11:53:26,092 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-08-22 11:53:26,093 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-08-22 11:53:26,093 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-08-22 11:53:26,094 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-08-22 11:53:26,095 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-08-22 11:53:26,095 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-08-22 11:53:26,096 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-08-22 11:53:26,096 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-08-22 11:53:26,096 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-08-22 11:53:26,104 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-08-22 11:53:26,105 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-08-22 11:53:26,106 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-NewStatesSleepUncond-NoLbe.epf
[2021-08-22 11:53:26,129 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-08-22 11:53:26,129 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-08-22 11:53:26,129 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-08-22 11:53:26,129 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-08-22 11:53:26,130 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-08-22 11:53:26,130 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-08-22 11:53:26,131 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-08-22 11:53:26,131 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-08-22 11:53:26,131 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-08-22 11:53:26,131 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-08-22 11:53:26,131 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-08-22 11:53:26,131 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-08-22 11:53:26,131 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-08-22 11:53:26,132 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-08-22 11:53:26,132 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-08-22 11:53:26,132 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-08-22 11:53:26,132 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-08-22 11:53:26,132 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-08-22 11:53:26,132 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-08-22 11:53:26,132 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-08-22 11:53:26,132 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-08-22 11:53:26,133 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2021-08-22 11:53:26,133 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-08-22 11:53:26,133 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-08-22 11:53:26,133 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-08-22 11:53:26,133 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-08-22 11:53:26,133 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-08-22 11:53:26,133 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-08-22 11:53:26,134 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-08-22 11:53:26,134 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2021-08-22 11:53:26,134 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2021-08-22 11:53:26,134 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-08-22 11:53:26,134 INFO  L138        SettingsManager]:  * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES
[2021-08-22 11:53:26,134 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2021-08-22 11:53:26,134 INFO  L138        SettingsManager]:  * Use conditional POR in concurrent analysis=false
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2021-08-22 11:53:26,448 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-08-22 11:53:26,465 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-08-22 11:53:26,467 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-08-22 11:53:26,467 INFO  L271        PluginConnector]: Initializing Boogie PL CUP Parser...
[2021-08-22 11:53:26,469 INFO  L275        PluginConnector]: Boogie PL CUP Parser initialized
[2021-08-22 11:53:26,469 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
[2021-08-22 11:53:26,470 INFO  L110           BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl'
[2021-08-22 11:53:26,492 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-08-22 11:53:26,493 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2021-08-22 11:53:26,494 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-08-22 11:53:26,494 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-08-22 11:53:26,494 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-08-22 11:53:26,504 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 22.08 11:53:26" (1/1) ...
[2021-08-22 11:53:26,511 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 22.08 11:53:26" (1/1) ...
[2021-08-22 11:53:26,518 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-08-22 11:53:26,519 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-08-22 11:53:26,520 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-08-22 11:53:26,520 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-08-22 11:53:26,526 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.08 11:53:26" (1/1) ...
[2021-08-22 11:53:26,527 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.08 11:53:26" (1/1) ...
[2021-08-22 11:53:26,529 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.08 11:53:26" (1/1) ...
[2021-08-22 11:53:26,530 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.08 11:53:26" (1/1) ...
[2021-08-22 11:53:26,537 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.08 11:53:26" (1/1) ...
[2021-08-22 11:53:26,540 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.08 11:53:26" (1/1) ...
[2021-08-22 11:53:26,542 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.08 11:53:26" (1/1) ...
[2021-08-22 11:53:26,547 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-08-22 11:53:26,548 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-08-22 11:53:26,548 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-08-22 11:53:26,548 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-08-22 11:53:26,553 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.08 11:53:26" (1/1) ...
[2021-08-22 11:53:26,559 INFO  L170          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-08-22 11:53:26,565 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-08-22 11:53:26,582 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)
[2021-08-22 11:53:26,593 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
[2021-08-22 11:53:26,627 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration
[2021-08-22 11:53:26,628 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2021-08-22 11:53:26,628 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2021-08-22 11:53:26,628 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration
[2021-08-22 11:53:26,628 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2021-08-22 11:53:26,628 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2021-08-22 11:53:26,629 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration
[2021-08-22 11:53:26,630 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-08-22 11:53:26,630 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-08-22 11:53:26,630 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration
[2021-08-22 11:53:26,630 INFO  L130     BoogieDeclarations]: Found specification of procedure thread3
[2021-08-22 11:53:26,630 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread3
[2021-08-22 11:53:26,630 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration
[2021-08-22 11:53:26,631 INFO  L130     BoogieDeclarations]: Found specification of procedure thread4
[2021-08-22 11:53:26,631 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread4
[2021-08-22 11:53:26,631 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration
[2021-08-22 11:53:26,632 INFO  L130     BoogieDeclarations]: Found specification of procedure thread5
[2021-08-22 11:53:26,632 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread5
[2021-08-22 11:53:26,633 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration
[2021-08-22 11:53:26,633 INFO  L130     BoogieDeclarations]: Found specification of procedure thread6
[2021-08-22 11:53:26,633 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread6
[2021-08-22 11:53:26,634 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-08-22 11:53:26,931 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-08-22 11:53:26,932 INFO  L299             CfgBuilder]: Removed 4 assume(true) statements.
[2021-08-22 11:53:26,933 INFO  L202        PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 11:53:26 BoogieIcfgContainer
[2021-08-22 11:53:26,934 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-08-22 11:53:26,935 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-08-22 11:53:26,935 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-08-22 11:53:26,938 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-08-22 11:53:26,938 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.08 11:53:26" (1/2) ...
[2021-08-22 11:53:26,939 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2d67e1 and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 11:53:26, skipping insertion in model container
[2021-08-22 11:53:26,939 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 11:53:26" (2/2) ...
[2021-08-22 11:53:26,940 INFO  L111   eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl
[2021-08-22 11:53:26,944 WARN  L149   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-08-22 11:53:26,944 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-08-22 11:53:26,944 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2021-08-22 11:53:26,944 INFO  L516   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-08-22 11:53:27,091 INFO  L148    ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions.
[2021-08-22 11:53:27,133 INFO  L170          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2021-08-22 11:53:27,133 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-08-22 11:53:27,134 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)
[2021-08-22 11:53:27,135 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
[2021-08-22 11:53:27,156 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2021-08-22 11:53:27,161 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, mConcurrency=PARTIAL_ORDER_FA, 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
[2021-08-22 11:53:27,161 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2021-08-22 11:53:27,757 INFO  L402      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] ===
[2021-08-22 11:53:27,768 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-22 11:53:27,769 INFO  L82        PathProgramCache]: Analyzing trace with hash -963017113, now seen corresponding path program 1 times
[2021-08-22 11:53:27,776 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-22 11:53:27,776 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445239911]
[2021-08-22 11:53:27,777 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-22 11:53:27,777 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-22 11:53:27,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-22 11:53:27,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 306 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked.
[2021-08-22 11:53:27,970 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-22 11:53:27,971 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445239911]
[2021-08-22 11:53:27,971 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445239911] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-22 11:53:27,971 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-22 11:53:27,971 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-08-22 11:53:27,973 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331580149]
[2021-08-22 11:53:27,978 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-08-22 11:53:27,979 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-22 11:53:27,988 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-08-22 11:53:27,991 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-22 11:53:27,991 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 11:53:27,993 INFO  L470      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2021-08-22 11:53:27,995 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)
[2021-08-22 11:53:27,995 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 11:53:28,274 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:28,275 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-08-22 11:53:28,275 INFO  L402      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] ===
[2021-08-22 11:53:28,279 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-22 11:53:28,279 INFO  L82        PathProgramCache]: Analyzing trace with hash 143439142, now seen corresponding path program 2 times
[2021-08-22 11:53:28,279 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-22 11:53:28,279 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870001370]
[2021-08-22 11:53:28,279 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-22 11:53:28,280 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-22 11:53:28,302 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-22 11:53:28,359 INFO  L134       CoverageAnalysis]: Checked inductivity of 173 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked.
[2021-08-22 11:53:28,373 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-22 11:53:28,373 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870001370]
[2021-08-22 11:53:28,373 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870001370] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-22 11:53:28,373 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-22 11:53:28,374 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-08-22 11:53:28,374 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857823269]
[2021-08-22 11:53:28,375 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-08-22 11:53:28,375 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-22 11:53:28,376 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-08-22 11:53:28,376 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-22 11:53:28,376 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 11:53:28,376 INFO  L470      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2021-08-22 11:53:28,377 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)
[2021-08-22 11:53:28,377 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:28,377 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 11:53:28,664 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:28,665 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:28,665 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-08-22 11:53:28,665 INFO  L402      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] ===
[2021-08-22 11:53:28,666 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-22 11:53:28,666 INFO  L82        PathProgramCache]: Analyzing trace with hash -1271555551, now seen corresponding path program 3 times
[2021-08-22 11:53:28,666 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-22 11:53:28,669 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110686153]
[2021-08-22 11:53:28,669 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-22 11:53:28,670 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-22 11:53:28,694 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-22 11:53:28,733 INFO  L134       CoverageAnalysis]: Checked inductivity of 190 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked.
[2021-08-22 11:53:28,734 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-22 11:53:28,734 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110686153]
[2021-08-22 11:53:28,734 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110686153] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-22 11:53:28,735 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-22 11:53:28,735 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-08-22 11:53:28,735 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268070418]
[2021-08-22 11:53:28,736 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-08-22 11:53:28,737 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-22 11:53:28,739 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-08-22 11:53:28,739 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-22 11:53:28,739 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 11:53:28,740 INFO  L470      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2021-08-22 11:53:28,741 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)
[2021-08-22 11:53:28,741 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:28,741 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:28,741 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 11:53:28,940 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:28,941 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:28,942 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:28,942 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-08-22 11:53:28,942 INFO  L402      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] ===
[2021-08-22 11:53:28,944 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-22 11:53:28,944 INFO  L82        PathProgramCache]: Analyzing trace with hash -419172420, now seen corresponding path program 4 times
[2021-08-22 11:53:28,944 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-22 11:53:28,945 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067380797]
[2021-08-22 11:53:28,945 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-22 11:53:28,945 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-22 11:53:28,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-22 11:53:28,995 INFO  L134       CoverageAnalysis]: Checked inductivity of 155 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked.
[2021-08-22 11:53:28,996 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-22 11:53:28,996 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067380797]
[2021-08-22 11:53:28,996 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067380797] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-22 11:53:28,996 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-22 11:53:28,996 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-08-22 11:53:28,996 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596033357]
[2021-08-22 11:53:28,997 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-08-22 11:53:28,997 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-22 11:53:28,997 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-08-22 11:53:28,998 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-22 11:53:28,998 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 11:53:28,998 INFO  L470      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2021-08-22 11:53:28,998 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)
[2021-08-22 11:53:28,998 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:28,998 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:28,999 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:28,999 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 11:53:29,025 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,027 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-08-22 11:53:29,027 INFO  L402      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] ===
[2021-08-22 11:53:29,027 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-22 11:53:29,027 INFO  L82        PathProgramCache]: Analyzing trace with hash -810421189, now seen corresponding path program 5 times
[2021-08-22 11:53:29,027 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-22 11:53:29,028 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522674641]
[2021-08-22 11:53:29,028 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-22 11:53:29,028 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-22 11:53:29,038 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-22 11:53:29,055 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2021-08-22 11:53:29,055 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-22 11:53:29,055 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522674641]
[2021-08-22 11:53:29,056 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522674641] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-22 11:53:29,056 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-22 11:53:29,056 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-08-22 11:53:29,056 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784154264]
[2021-08-22 11:53:29,057 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-08-22 11:53:29,057 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-22 11:53:29,057 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-08-22 11:53:29,057 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-22 11:53:29,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 11:53:29,058 INFO  L470      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2021-08-22 11:53:29,058 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)
[2021-08-22 11:53:29,058 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,058 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,058 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,058 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,058 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 11:53:29,078 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,079 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,079 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,079 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,080 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-08-22 11:53:29,080 INFO  L402      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] ===
[2021-08-22 11:53:29,080 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-22 11:53:29,081 INFO  L82        PathProgramCache]: Analyzing trace with hash 1250660342, now seen corresponding path program 6 times
[2021-08-22 11:53:29,081 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-22 11:53:29,081 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994641744]
[2021-08-22 11:53:29,081 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-22 11:53:29,081 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-22 11:53:29,091 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-22 11:53:29,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2021-08-22 11:53:29,107 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-22 11:53:29,107 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994641744]
[2021-08-22 11:53:29,107 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994641744] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-22 11:53:29,107 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-22 11:53:29,108 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-08-22 11:53:29,108 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718342154]
[2021-08-22 11:53:29,108 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-08-22 11:53:29,108 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-22 11:53:29,109 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-08-22 11:53:29,109 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-22 11:53:29,109 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 11:53:29,109 INFO  L470      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2021-08-22 11:53:29,109 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)
[2021-08-22 11:53:29,110 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,110 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,110 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,110 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,110 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,110 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 11:53:29,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,128 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:29,128 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-08-22 11:53:29,128 INFO  L402      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] ===
[2021-08-22 11:53:29,128 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-22 11:53:29,129 INFO  L82        PathProgramCache]: Analyzing trace with hash -79880111, now seen corresponding path program 7 times
[2021-08-22 11:53:29,129 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-22 11:53:29,129 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445666050]
[2021-08-22 11:53:29,129 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-22 11:53:29,129 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-22 11:53:29,145 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-22 11:53:29,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-22 11:53:29,782 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-22 11:53:29,782 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445666050]
[2021-08-22 11:53:29,783 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445666050] provided 0 perfect and 1 imperfect interpolant sequences
[2021-08-22 11:53:29,783 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385323131]
[2021-08-22 11:53:29,783 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2021-08-22 11:53:29,786 INFO  L170          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-08-22 11:53:29,786 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-08-22 11:53:29,789 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)
[2021-08-22 11:53:29,822 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2021-08-22 11:53:29,884 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-22 11:53:29,887 INFO  L263         TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 37 conjunts are in the unsatisfiable core
[2021-08-22 11:53:29,896 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2021-08-22 11:53:30,696 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-22 11:53:30,697 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385323131] provided 0 perfect and 1 imperfect interpolant sequences
[2021-08-22 11:53:30,697 INFO  L186   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2021-08-22 11:53:30,697 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14
[2021-08-22 11:53:30,697 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843811400]
[2021-08-22 11:53:30,698 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2021-08-22 11:53:30,698 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-22 11:53:30,698 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-08-22 11:53:30,699 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210
[2021-08-22 11:53:30,699 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 11:53:30,699 INFO  L470      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2021-08-22 11:53:30,699 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)
[2021-08-22 11:53:30,699 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:30,699 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:30,699 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:30,699 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:30,700 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:30,700 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:30,700 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 11:53:31,250 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:31,251 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:31,251 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:31,251 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:31,251 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:31,251 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 11:53:31,252 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-08-22 11:53:31,284 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2021-08-22 11:53:31,480 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
[2021-08-22 11:53:31,481 INFO  L402      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [thread1Err0INUSE_VIOLATION, thread1Err7INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION (and 7 more)] ===
[2021-08-22 11:53:31,481 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-22 11:53:31,482 INFO  L82        PathProgramCache]: Analyzing trace with hash 1428257903, now seen corresponding path program 8 times
[2021-08-22 11:53:31,482 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-22 11:53:31,482 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041968683]
[2021-08-22 11:53:31,482 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-22 11:53:31,482 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-22 11:53:31,496 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-08-22 11:53:31,496 INFO  L354             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-08-22 11:53:31,515 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-08-22 11:53:31,564 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-08-22 11:53:31,564 INFO  L626         BasicCegarLoop]: Counterexample is feasible
[2021-08-22 11:53:31,565 INFO  L764   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT
[2021-08-22 11:53:31,568 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0INUSE_VIOLATION
[2021-08-22 11:53:31,569 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7INUSE_VIOLATION
[2021-08-22 11:53:31,569 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8INUSE_VIOLATION
[2021-08-22 11:53:31,569 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9INUSE_VIOLATION
[2021-08-22 11:53:31,569 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3INUSE_VIOLATION
[2021-08-22 11:53:31,569 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err5INUSE_VIOLATION
[2021-08-22 11:53:31,569 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork2Err1INUSE_VIOLATION
[2021-08-22 11:53:31,569 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork2Err2INUSE_VIOLATION
[2021-08-22 11:53:31,569 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork3Err4INUSE_VIOLATION
[2021-08-22 11:53:31,569 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork3Err6INUSE_VIOLATION
[2021-08-22 11:53:31,570 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-08-22 11:53:31,578 INFO  L229   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-08-22 11:53:31,578 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2021-08-22 11:53:31,624 INFO  L202        PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 11:53:31 BasicIcfg
[2021-08-22 11:53:31,625 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-08-22 11:53:31,627 INFO  L168              Benchmark]: Toolchain (without parser) took 5132.83 ms. Allocated memory was 195.0 MB in the beginning and 277.9 MB in the end (delta: 82.8 MB). Free memory was 175.1 MB in the beginning and 207.5 MB in the end (delta: -32.5 MB). Peak memory consumption was 51.6 MB. Max. memory is 8.0 GB.
[2021-08-22 11:53:31,627 INFO  L168              Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 195.0 MB. Free memory is still 176.3 MB. There was no memory consumed. Max. memory is 8.0 GB.
[2021-08-22 11:53:31,627 INFO  L168              Benchmark]: Boogie Procedure Inliner took 24.50 ms. Allocated memory is still 195.0 MB. Free memory was 174.8 MB in the beginning and 173.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB.
[2021-08-22 11:53:31,628 INFO  L168              Benchmark]: Boogie Preprocessor took 27.46 ms. Allocated memory is still 195.0 MB. Free memory was 173.4 MB in the beginning and 172.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB.
[2021-08-22 11:53:31,628 INFO  L168              Benchmark]: RCFGBuilder took 385.89 ms. Allocated memory is still 195.0 MB. Free memory was 172.4 MB in the beginning and 156.6 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB.
[2021-08-22 11:53:31,629 INFO  L168              Benchmark]: TraceAbstraction took 4690.00 ms. Allocated memory was 195.0 MB in the beginning and 277.9 MB in the end (delta: 82.8 MB). Free memory was 156.2 MB in the beginning and 207.5 MB in the end (delta: -51.3 MB). Peak memory consumption was 32.7 MB. Max. memory is 8.0 GB.
[2021-08-22 11:53:31,630 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.15 ms. Allocated memory is still 195.0 MB. Free memory is still 176.3 MB. There was no memory consumed. Max. memory is 8.0 GB.
 * Boogie Procedure Inliner took 24.50 ms. Allocated memory is still 195.0 MB. Free memory was 174.8 MB in the beginning and 173.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB.
 * Boogie Preprocessor took 27.46 ms. Allocated memory is still 195.0 MB. Free memory was 173.4 MB in the beginning and 172.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB.
 * RCFGBuilder took 385.89 ms. Allocated memory is still 195.0 MB. Free memory was 172.4 MB in the beginning and 156.6 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB.
 * TraceAbstraction took 4690.00 ms. Allocated memory was 195.0 MB in the beginning and 277.9 MB in the end (delta: 82.8 MB). Free memory was 156.2 MB in the beginning and 207.5 MB in the end (delta: -51.3 MB). Peak memory consumption was 32.7 MB. Max. memory is 8.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Independence relation benchmarks
    ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 98310, positive: 91302, positive conditional: 91302, positive unconditional: 0, negative: 7008, negative conditional: 7008, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93156, positive: 91302, positive conditional: 0, positive unconditional: 91302, negative: 1854, negative conditional: 0, negative unconditional: 1854, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 706, positive: 686, positive conditional: 0, positive unconditional: 686, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 706, positive: 678, positive conditional: 0, positive unconditional: 678, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 163, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 137, negative conditional: 0, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 93156, positive: 90616, positive conditional: 0, positive unconditional: 90616, negative: 1834, negative conditional: 0, negative unconditional: 1834, unknown: 706, unknown conditional: 0, unknown unconditional: 706] , Statistics on independence cache: Total cache size (in pairs): 706, Positive cache size: 686, Positive conditional cache size: 0, Positive unconditional cache size: 686, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Independence queries for same thread: 5154
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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: 4443.8ms, OverallIterations: 8, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15.1ms, PartialOrderReductionTime: 1966.5ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms 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.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 42.3ms SsaConstructionTime, 149.1ms SatisfiabilityAnalysisTime, 1702.1ms InterpolantComputationTime, 871 NumberOfCodeBlocks, 871 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 792 ConstructedInterpolants, 0 QuantifiedInterpolants, 2190 SizeOfPredicates, 16 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 885/893 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!
[2021-08-22 11:53:31,662 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
[2021-08-22 11:53:31,862 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...