/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-Lockstep.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 01:30:28,195 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-08-22 01:30:28,197 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-08-22 01:30:28,234 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-08-22 01:30:28,235 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-08-22 01:30:28,237 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-08-22 01:30:28,239 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-08-22 01:30:28,244 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-08-22 01:30:28,246 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-08-22 01:30:28,250 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-08-22 01:30:28,251 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-08-22 01:30:28,252 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-08-22 01:30:28,253 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-08-22 01:30:28,254 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-08-22 01:30:28,256 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-08-22 01:30:28,259 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-08-22 01:30:28,260 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-08-22 01:30:28,261 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-08-22 01:30:28,263 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-08-22 01:30:28,270 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-08-22 01:30:28,271 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-08-22 01:30:28,272 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-08-22 01:30:28,273 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-08-22 01:30:28,275 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-08-22 01:30:28,281 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-08-22 01:30:28,281 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-08-22 01:30:28,281 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-08-22 01:30:28,283 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-08-22 01:30:28,285 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-08-22 01:30:28,286 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-08-22 01:30:28,286 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-08-22 01:30:28,287 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-08-22 01:30:28,288 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-08-22 01:30:28,289 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-08-22 01:30:28,290 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-08-22 01:30:28,290 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-08-22 01:30:28,290 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-08-22 01:30:28,290 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-08-22 01:30:28,291 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-08-22 01:30:28,291 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-08-22 01:30:28,292 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-08-22 01:30:28,293 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-Lockstep.epf
[2021-08-22 01:30:28,327 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-08-22 01:30:28,328 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-08-22 01:30:28,328 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-08-22 01:30:28,328 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-08-22 01:30:28,331 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-08-22 01:30:28,331 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-08-22 01:30:28,331 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-08-22 01:30:28,332 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-08-22 01:30:28,332 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-08-22 01:30:28,332 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-08-22 01:30:28,333 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-08-22 01:30:28,333 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-08-22 01:30:28,333 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-08-22 01:30:28,333 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-08-22 01:30:28,334 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-08-22 01:30:28,334 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-08-22 01:30:28,334 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-08-22 01:30:28,334 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-08-22 01:30:28,334 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-08-22 01:30:28,335 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-08-22 01:30:28,335 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-08-22 01:30:28,335 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2021-08-22 01:30:28,335 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-08-22 01:30:28,335 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-08-22 01:30:28,335 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-08-22 01:30:28,336 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-08-22 01:30:28,336 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-08-22 01:30:28,336 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-08-22 01:30:28,336 INFO  L138        SettingsManager]:  * DFS Order used in POR=PSEUDO_LOCKSTEP
[2021-08-22 01:30:28,336 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-08-22 01:30:28,336 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2021-08-22 01:30:28,337 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2021-08-22 01:30:28,337 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-08-22 01:30:28,337 INFO  L138        SettingsManager]:  * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES
[2021-08-22 01:30:28,337 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
[2021-08-22 01:30:28,678 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-08-22 01:30:28,701 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-08-22 01:30:28,704 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-08-22 01:30:28,704 INFO  L271        PluginConnector]: Initializing Boogie PL CUP Parser...
[2021-08-22 01:30:28,706 INFO  L275        PluginConnector]: Boogie PL CUP Parser initialized
[2021-08-22 01:30:28,707 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 01:30:28,707 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 01:30:28,748 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-08-22 01:30:28,751 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2021-08-22 01:30:28,752 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-08-22 01:30:28,752 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-08-22 01:30:28,752 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-08-22 01:30:28,763 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 01:30:28" (1/1) ...
[2021-08-22 01:30:28,771 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 01:30:28" (1/1) ...
[2021-08-22 01:30:28,779 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-08-22 01:30:28,785 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-08-22 01:30:28,785 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-08-22 01:30:28,785 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-08-22 01:30:28,792 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 01:30:28" (1/1) ...
[2021-08-22 01:30:28,792 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 01:30:28" (1/1) ...
[2021-08-22 01:30:28,795 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 01:30:28" (1/1) ...
[2021-08-22 01:30:28,795 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 01:30:28" (1/1) ...
[2021-08-22 01:30:28,803 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 01:30:28" (1/1) ...
[2021-08-22 01:30:28,806 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 01:30:28" (1/1) ...
[2021-08-22 01:30:28,808 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 01:30:28" (1/1) ...
[2021-08-22 01:30:28,814 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-08-22 01:30:28,815 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-08-22 01:30:28,815 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-08-22 01:30:28,816 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-08-22 01:30:28,817 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 01:30:28" (1/1) ...
[2021-08-22 01:30:28,824 INFO  L170          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-08-22 01:30:28,829 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-08-22 01:30:28,839 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 01:30:28,863 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 01:30:28,882 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration
[2021-08-22 01:30:28,882 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2021-08-22 01:30:28,882 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2021-08-22 01:30:28,882 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration
[2021-08-22 01:30:28,882 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2021-08-22 01:30:28,883 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2021-08-22 01:30:28,883 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration
[2021-08-22 01:30:28,883 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-08-22 01:30:28,883 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-08-22 01:30:28,883 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration
[2021-08-22 01:30:28,883 INFO  L130     BoogieDeclarations]: Found specification of procedure thread3
[2021-08-22 01:30:28,883 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread3
[2021-08-22 01:30:28,883 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration
[2021-08-22 01:30:28,884 INFO  L130     BoogieDeclarations]: Found specification of procedure thread4
[2021-08-22 01:30:28,884 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread4
[2021-08-22 01:30:28,884 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration
[2021-08-22 01:30:28,884 INFO  L130     BoogieDeclarations]: Found specification of procedure thread5
[2021-08-22 01:30:28,885 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread5
[2021-08-22 01:30:28,886 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration
[2021-08-22 01:30:28,886 INFO  L130     BoogieDeclarations]: Found specification of procedure thread6
[2021-08-22 01:30:28,888 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread6
[2021-08-22 01:30:28,888 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 01:30:29,143 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-08-22 01:30:29,144 INFO  L299             CfgBuilder]: Removed 4 assume(true) statements.
[2021-08-22 01:30:29,146 INFO  L202        PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 01:30:29 BoogieIcfgContainer
[2021-08-22 01:30:29,146 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-08-22 01:30:29,147 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-08-22 01:30:29,148 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-08-22 01:30:29,150 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-08-22 01:30:29,150 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 01:30:28" (1/2) ...
[2021-08-22 01:30:29,151 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13122bc5 and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 01:30:29, skipping insertion in model container
[2021-08-22 01:30:29,151 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 01:30:29" (2/2) ...
[2021-08-22 01:30:29,153 INFO  L111   eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl
[2021-08-22 01:30:29,168 WARN  L149   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-08-22 01:30:29,169 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-08-22 01:30:29,169 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2021-08-22 01:30:29,169 INFO  L516   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-08-22 01:30:29,352 INFO  L148    ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions.
[2021-08-22 01:30:29,402 INFO  L170          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2021-08-22 01:30:29,402 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-08-22 01:30:29,406 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 01:30:29,407 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 01:30:29,437 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2021-08-22 01:30:29,444 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 01:30:29,444 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2021-08-22 01:30:30,073 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 01:30:30,081 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-22 01:30:30,082 INFO  L82        PathProgramCache]: Analyzing trace with hash -680969095, now seen corresponding path program 1 times
[2021-08-22 01:30:30,089 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-22 01:30:30,089 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007027319]
[2021-08-22 01:30:30,090 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-22 01:30:30,090 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-22 01:30:30,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-22 01:30:30,378 INFO  L134       CoverageAnalysis]: Checked inductivity of 3670 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 3532 trivial. 0 not checked.
[2021-08-22 01:30:30,378 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-22 01:30:30,379 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007027319]
[2021-08-22 01:30:30,379 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007027319] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-22 01:30:30,379 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-22 01:30:30,380 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-08-22 01:30:30,381 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514835037]
[2021-08-22 01:30:30,387 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-08-22 01:30:30,387 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-22 01:30:30,396 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-08-22 01:30:30,398 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-22 01:30:30,398 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 01:30:30,399 INFO  L470      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2021-08-22 01:30:30,401 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 01:30:30,401 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 01:30:30,528 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:30,529 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-08-22 01:30:30,529 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 01:30:30,532 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-22 01:30:30,532 INFO  L82        PathProgramCache]: Analyzing trace with hash -973922514, now seen corresponding path program 2 times
[2021-08-22 01:30:30,533 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-22 01:30:30,533 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095151349]
[2021-08-22 01:30:30,533 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-22 01:30:30,534 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-22 01:30:30,564 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-22 01:30:30,647 INFO  L134       CoverageAnalysis]: Checked inductivity of 511 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked.
[2021-08-22 01:30:30,647 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-22 01:30:30,648 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095151349]
[2021-08-22 01:30:30,648 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095151349] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-22 01:30:30,648 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-22 01:30:30,648 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-08-22 01:30:30,648 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863307875]
[2021-08-22 01:30:30,651 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-08-22 01:30:30,651 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-22 01:30:30,656 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-08-22 01:30:30,657 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-22 01:30:30,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 01:30:30,657 INFO  L470      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2021-08-22 01:30:30,657 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 01:30:30,658 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:30,658 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 01:30:31,042 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,042 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,043 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-08-22 01:30:31,043 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 01:30:31,044 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-22 01:30:31,044 INFO  L82        PathProgramCache]: Analyzing trace with hash -1450919676, now seen corresponding path program 3 times
[2021-08-22 01:30:31,044 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-22 01:30:31,045 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930678128]
[2021-08-22 01:30:31,045 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-22 01:30:31,046 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-22 01:30:31,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-22 01:30:31,152 INFO  L134       CoverageAnalysis]: Checked inductivity of 2247 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 1978 trivial. 0 not checked.
[2021-08-22 01:30:31,152 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-22 01:30:31,152 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930678128]
[2021-08-22 01:30:31,152 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930678128] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-22 01:30:31,153 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-22 01:30:31,153 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-08-22 01:30:31,154 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091544189]
[2021-08-22 01:30:31,154 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-08-22 01:30:31,155 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-22 01:30:31,155 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-08-22 01:30:31,156 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-22 01:30:31,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 01:30:31,156 INFO  L470      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2021-08-22 01:30:31,157 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 01:30:31,157 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,158 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,158 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 01:30:31,237 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,238 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,238 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,238 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-08-22 01:30:31,239 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 01:30:31,240 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-22 01:30:31,240 INFO  L82        PathProgramCache]: Analyzing trace with hash -1386839025, now seen corresponding path program 4 times
[2021-08-22 01:30:31,241 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-22 01:30:31,241 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429701869]
[2021-08-22 01:30:31,241 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-22 01:30:31,241 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-22 01:30:31,268 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-22 01:30:31,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 666 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked.
[2021-08-22 01:30:31,311 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-22 01:30:31,311 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429701869]
[2021-08-22 01:30:31,311 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429701869] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-22 01:30:31,311 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-22 01:30:31,312 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-08-22 01:30:31,312 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375361918]
[2021-08-22 01:30:31,313 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-08-22 01:30:31,316 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-22 01:30:31,318 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-08-22 01:30:31,318 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-22 01:30:31,321 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 01:30:31,325 INFO  L470      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2021-08-22 01:30:31,325 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 01:30:31,325 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,325 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,325 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,326 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 01:30:31,365 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,365 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,366 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,366 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,367 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-08-22 01:30:31,367 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 01:30:31,367 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-22 01:30:31,367 INFO  L82        PathProgramCache]: Analyzing trace with hash 2136322129, now seen corresponding path program 5 times
[2021-08-22 01:30:31,367 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-22 01:30:31,368 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107533352]
[2021-08-22 01:30:31,368 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-22 01:30:31,369 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-22 01:30:31,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-22 01:30:31,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 666 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked.
[2021-08-22 01:30:31,464 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-22 01:30:31,465 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107533352]
[2021-08-22 01:30:31,465 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107533352] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-22 01:30:31,465 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-22 01:30:31,465 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-08-22 01:30:31,465 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656350429]
[2021-08-22 01:30:31,466 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-08-22 01:30:31,466 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-22 01:30:31,466 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-08-22 01:30:31,466 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-22 01:30:31,466 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 01:30:31,467 INFO  L470      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2021-08-22 01:30:31,467 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:30:31,467 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,467 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,467 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,467 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:31,467 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 01:30:32,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:32,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:32,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:32,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:32,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:32,081 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-08-22 01:30:32,081 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 01:30:32,081 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-22 01:30:32,081 INFO  L82        PathProgramCache]: Analyzing trace with hash -2068569246, now seen corresponding path program 6 times
[2021-08-22 01:30:32,082 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-22 01:30:32,082 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850943415]
[2021-08-22 01:30:32,082 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-22 01:30:32,082 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-22 01:30:32,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-22 01:30:32,120 INFO  L134       CoverageAnalysis]: Checked inductivity of 397 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked.
[2021-08-22 01:30:32,120 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-22 01:30:32,121 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850943415]
[2021-08-22 01:30:32,121 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850943415] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-22 01:30:32,121 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-22 01:30:32,121 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-08-22 01:30:32,121 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603446263]
[2021-08-22 01:30:32,122 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-08-22 01:30:32,122 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-22 01:30:32,122 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-08-22 01:30:32,123 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-22 01:30:32,123 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 01:30:32,123 INFO  L470      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2021-08-22 01:30:32,123 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 01:30:32,123 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:32,123 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:32,123 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:32,123 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:32,123 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:32,124 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2021-08-22 01:30:32,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:32,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:32,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:32,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:32,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:32,311 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-22 01:30:32,311 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-08-22 01:30:32,311 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 01:30:32,311 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-22 01:30:32,311 INFO  L82        PathProgramCache]: Analyzing trace with hash -760018299, now seen corresponding path program 7 times
[2021-08-22 01:30:32,312 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-22 01:30:32,312 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740763460]
[2021-08-22 01:30:32,312 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-22 01:30:32,312 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-22 01:30:32,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-08-22 01:30:32,335 INFO  L354             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-08-22 01:30:32,348 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-08-22 01:30:32,378 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-08-22 01:30:32,378 INFO  L626         BasicCegarLoop]: Counterexample is feasible
[2021-08-22 01:30:32,379 INFO  L764   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT
[2021-08-22 01:30:32,381 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0INUSE_VIOLATION
[2021-08-22 01:30:32,381 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7INUSE_VIOLATION
[2021-08-22 01:30:32,381 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8INUSE_VIOLATION
[2021-08-22 01:30:32,382 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9INUSE_VIOLATION
[2021-08-22 01:30:32,382 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3INUSE_VIOLATION
[2021-08-22 01:30:32,382 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err5INUSE_VIOLATION
[2021-08-22 01:30:32,386 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork2Err1INUSE_VIOLATION
[2021-08-22 01:30:32,386 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location thread1Thread1of1ForFork2Err2INUSE_VIOLATION
[2021-08-22 01:30:32,386 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork3Err4INUSE_VIOLATION
[2021-08-22 01:30:32,386 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location thread4Thread1of1ForFork3Err6INUSE_VIOLATION
[2021-08-22 01:30:32,387 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-08-22 01:30:32,397 INFO  L229   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-08-22 01:30:32,397 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2021-08-22 01:30:32,452 INFO  L202        PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 01:30:32 BasicIcfg
[2021-08-22 01:30:32,452 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-08-22 01:30:32,453 INFO  L168              Benchmark]: Toolchain (without parser) took 3702.62 ms. Allocated memory was 202.4 MB in the beginning and 254.8 MB in the end (delta: 52.4 MB). Free memory was 183.0 MB in the beginning and 193.8 MB in the end (delta: -10.8 MB). Peak memory consumption was 42.3 MB. Max. memory is 8.0 GB.
[2021-08-22 01:30:32,454 INFO  L168              Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 202.4 MB. Free memory was 184.3 MB in the beginning and 184.1 MB in the end (delta: 132.5 kB). There was no memory consumed. Max. memory is 8.0 GB.
[2021-08-22 01:30:32,454 INFO  L168              Benchmark]: Boogie Procedure Inliner took 27.45 ms. Allocated memory is still 202.4 MB. Free memory was 182.8 MB in the beginning and 181.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 01:30:32,456 INFO  L168              Benchmark]: Boogie Preprocessor took 29.30 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 180.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB.
[2021-08-22 01:30:32,457 INFO  L168              Benchmark]: RCFGBuilder took 330.59 ms. Allocated memory is still 202.4 MB. Free memory was 180.2 MB in the beginning and 164.6 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB.
[2021-08-22 01:30:32,457 INFO  L168              Benchmark]: TraceAbstraction took 3304.50 ms. Allocated memory was 202.4 MB in the beginning and 254.8 MB in the end (delta: 52.4 MB). Free memory was 164.1 MB in the beginning and 193.8 MB in the end (delta: -29.7 MB). Peak memory consumption was 23.4 MB. Max. memory is 8.0 GB.
[2021-08-22 01:30:32,459 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 202.4 MB. Free memory was 184.3 MB in the beginning and 184.1 MB in the end (delta: 132.5 kB). There was no memory consumed. Max. memory is 8.0 GB.
 * Boogie Procedure Inliner took 27.45 ms. Allocated memory is still 202.4 MB. Free memory was 182.8 MB in the beginning and 181.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 29.30 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 180.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB.
 * RCFGBuilder took 330.59 ms. Allocated memory is still 202.4 MB. Free memory was 180.2 MB in the beginning and 164.6 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB.
 * TraceAbstraction took 3304.50 ms. Allocated memory was 202.4 MB in the beginning and 254.8 MB in the end (delta: 52.4 MB). Free memory was 164.1 MB in the beginning and 193.8 MB in the end (delta: -29.7 MB). Peak memory consumption was 23.4 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: 88534, positive: 83131, positive conditional: 83131, positive unconditional: 0, negative: 5403, negative conditional: 5403, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 85416, positive: 83131, positive conditional: 83131, positive unconditional: 0, negative: 2285, negative conditional: 2285, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 85416, positive: 83131, positive conditional: 83131, positive unconditional: 0, negative: 2285, negative conditional: 2285, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89794, positive: 83131, positive conditional: 71363, positive unconditional: 11768, negative: 6663, negative conditional: 4378, negative unconditional: 2285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 89794, positive: 83131, positive conditional: 10047, positive unconditional: 73084, negative: 6663, negative conditional: 609, negative unconditional: 6054, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 89794, positive: 83131, positive conditional: 10047, positive unconditional: 73084, negative: 6663, negative conditional: 609, negative unconditional: 6054, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1395, positive: 1345, positive conditional: 10, positive unconditional: 1335, negative: 50, negative conditional: 10, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1395, positive: 1325, positive conditional: 0, positive unconditional: 1325, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, positive: 20, positive conditional: 4, positive unconditional: 16, negative: 50, negative conditional: 10, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, positive: 29, positive conditional: 7, positive unconditional: 22, negative: 163, negative conditional: 13, negative unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 89794, positive: 81786, positive conditional: 10037, positive unconditional: 71749, negative: 6613, negative conditional: 599, negative unconditional: 6014, unknown: 1395, unknown conditional: 20, unknown unconditional: 1375] , Statistics on independence cache: Total cache size (in pairs): 1395, Positive cache size: 1345, Positive conditional cache size: 10, Positive unconditional cache size: 1335, Negative cache size: 50, Negative conditional cache size: 10, Negative unconditional cache size: 40, Eliminated conditions: 65085, Maximal queried relation: 4, Independence queries for same thread: 3118
  - 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=-3, x_8=-3, y_1=-3, y_9=-3]
[L116]  FORK  0  fork 1 thread1();
        VAL      [x_0=-3, x_8=-3, y_1=-3, y_9=-3]
[L60]         1  f1_2 := false;
[L61]         1  f2_3 := false;
        VAL      [f1_2=false, f2_3=false, x_0=-3, x_8=-3, y_1=-3, y_9=-3]
[L117]  FORK  0  fork 4, 4, 4, 4 thread4();
        VAL      [f1_2=false, f2_3=false, x_0=-3, x_8=-3, y_1=-3, y_9=-3]
[L63]   FORK  1  fork 2, 2 thread2();
        VAL      [f1_2=false, f2_3=false, x_0=-3, x_8=-3, y_1=-3, y_9=-3]
[L30]         3  temp_4 := x_0;
        VAL      [f1_2=false, f2_3=false, temp_4=-3, x_0=-3, x_8=-3, y_1=-3, y_9=-3]
[L103]        2  f1_10 := false;
[L104]        2  f2_11 := false;
        VAL      [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-3, x_0=-3, x_8=-3, y_1=-3, y_9=-3]
[L64]   FORK  1  fork 3, 3, 3 thread3();
        VAL      [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-3, x_0=-3, x_8=-3, y_1=-3, y_9=-3]
[L31]         3  x_0 := temp_4 + 1;
        VAL      [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-3, x_0=-2, x_8=-3, y_1=-3, y_9=-3]
[L45]         4  temp_6 := y_1;
        VAL      [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-3, temp_6=-3, x_0=-2, x_8=-3, y_1=-3, y_9=-3]
[L106]  FORK  2  fork 5, 5, 5, 5, 5 thread5();
        VAL      [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-3, temp_6=-3, x_0=-2, x_8=-3, y_1=-3, y_9=-3]
[L73]         5  temp_12 := x_8;
        VAL      [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, temp_6=-3, x_0=-2, x_8=-3, y_1=-3, y_9=-3]
[L32]         3  f1_2 := true;
        VAL      [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, temp_6=-3, x_0=-2, x_8=-3, y_1=-3, y_9=-3]
[L46]         4  y_1 := temp_6 + 1;
        VAL      [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, temp_6=-3, x_0=-2, x_8=-3, y_1=-2, y_9=-3]
[L107]  FORK  2  fork 6, 6, 6, 6, 6, 6 thread6();
        VAL      [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, temp_6=-3, x_0=-2, x_8=-3, y_1=-2, y_9=-3]
[L74]         5  x_8 := temp_12 + 1;
        VAL      [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, temp_6=-3, x_0=-2, x_8=-2, y_1=-2, y_9=-3]
[L88]         6  temp_14 := y_9;
        VAL      [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_14=-3, temp_4=-3, temp_6=-3, x_0=-2, x_8=-2, y_1=-2, y_9=-3]
[L47]         4  f2_3 := true;
        VAL      [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_14=-3, temp_4=-3, temp_6=-3, x_0=-2, x_8=-2, y_1=-2, y_9=-3]
[L75]         5  f1_10 := true;
        VAL      [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_14=-3, temp_4=-3, temp_6=-3, x_0=-2, x_8=-2, y_1=-2, y_9=-3]
[L89]         6  y_9 := temp_14 + 1;
        VAL      [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_14=-3, temp_4=-3, temp_6=-3, x_0=-2, x_8=-2, y_1=-2, y_9=-2]
[L33]         3  assume f2_3;
        VAL      [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_14=-3, temp_4=-3, temp_6=-3, x_0=-2, x_8=-2, y_1=-2, y_9=-2]
[L34]         3  temp_5 := y_1;
        VAL      [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, x_0=-2, x_8=-2, y_1=-2, y_9=-2]
[L48]         4  assume f1_2;
        VAL      [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, x_0=-2, x_8=-2, y_1=-2, y_9=-2]
[L90]         6  f2_11 := true;
        VAL      [f1_10=true, f1_2=true, f2_11=true, f2_3=true, temp_12=-3, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, x_0=-2, x_8=-2, y_1=-2, y_9=-2]
[L35]         3  y_1 := temp_5 + 1;
        VAL      [f1_10=true, f1_2=true, f2_11=true, f2_3=true, temp_12=-3, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, x_0=-2, x_8=-2, y_1=-1, y_9=-2]
[L49]         4  temp_7 := x_0;
        VAL      [f1_10=true, f1_2=true, f2_11=true, f2_3=true, temp_12=-3, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-2, x_8=-2, y_1=-1, y_9=-2]
[L76]         5  assume f2_11;
        VAL      [f1_10=true, f1_2=true, f2_11=true, f2_3=true, temp_12=-3, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-2, x_8=-2, y_1=-1, y_9=-2]
[L77]         5  temp_13 := y_9;
        VAL      [f1_10=true, f1_2=true, f2_11=true, f2_3=true, temp_12=-3, temp_13=-2, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-2, x_8=-2, y_1=-1, y_9=-2]
[L91]         6  assume f1_10;
        VAL      [f1_10=true, f1_2=true, f2_11=true, f2_3=true, temp_12=-3, temp_13=-2, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-2, x_8=-2, y_1=-1, y_9=-2]
[L36]         3  f1_2 := false;
        VAL      [f1_10=true, f1_2=false, f2_11=true, f2_3=true, temp_12=-3, temp_13=-2, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-2, x_8=-2, y_1=-1, y_9=-2]
[L50]         4  x_0 := temp_7 + 1;
        VAL      [f1_10=true, f1_2=false, f2_11=true, f2_3=true, temp_12=-3, temp_13=-2, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-2]
[L78]         5  y_9 := temp_13 + 1;
        VAL      [f1_10=true, f1_2=false, f2_11=true, f2_3=true, temp_12=-3, temp_13=-2, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-1]
[L92]         6  temp_15 := x_8;
        VAL      [f1_10=true, f1_2=false, f2_11=true, f2_3=true, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-1]
[L51]         4  f2_3 := false;
        VAL      [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-1]
[L79]         5  f1_10 := false;
        VAL      [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, 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=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1]
[L94]         6  f2_11 := false;
        VAL      [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, 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_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, 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_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1]
[L80]         5  assume !f2_11;
        VAL      [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1]
[L95]         6  assume !f1_10;
        VAL      [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, 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_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1]
[L45]         4  temp_6 := y_1;
        VAL      [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, 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_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, 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_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, 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_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, 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_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, 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_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, x_0=0, x_8=-1, y_1=0, y_9=-1]
[L48]         4  assume f1_2;
        VAL      [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, x_0=0, x_8=-1, y_1=0, y_9=-1]
[L108]  JOIN  5  join 5, 5, 5, 5, 5;
        VAL      [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, x_0=0, x_8=-1, y_1=0, y_9=-1]
[L109]  JOIN  6  join 6, 6, 6, 6, 6, 6;
        VAL      [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, 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_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=0, temp_6=-1, temp_7=-2, x_0=0, x_8=-1, y_1=0, y_9=-1]
[L49]         4  temp_7 := x_0;
        VAL      [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, 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_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, 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=true, f2_11=false, f2_3=true, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, 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_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, 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_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, 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_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, 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_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1]
[L65]   JOIN  3  join 2, 2;
        VAL      [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, 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=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1]
[L118]  JOIN  1  join 1;
        VAL      [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1]
[L119]  JOIN  2  join 4, 4, 4, 4;
        VAL      [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1]
[L120]        0  assume !(x_0 == x_8 && y_1 == y_9);
        VAL      [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1]
[L121]        0  assert false;
        VAL      [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-1, y_1=1, y_9=-1]

  - UnprovableResult [Line: 63]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 59]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 116]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 116]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 106]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 102]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 59]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 63]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 102]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 106]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 2994.0ms, OverallIterations: 7, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 51.9ms, PartialOrderReductionTime: 2009.3ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 18, 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.5ms SsaConstructionTime, 161.3ms SatisfiabilityAnalysisTime, 448.8ms InterpolantComputationTime, 1849 NumberOfCodeBlocks, 1849 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1772 ConstructedInterpolants, 0 QuantifiedInterpolants, 1844 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 8157/8157 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 01:30:32,502 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 01:30:32,707 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...