/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-NewStatesSleepPersistent-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-11 06:09:24,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-11 06:09:24,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-11 06:09:24,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-11 06:09:24,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-11 06:09:24,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-11 06:09:24,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-11 06:09:24,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-11 06:09:24,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-11 06:09:24,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-11 06:09:24,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-11 06:09:24,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-11 06:09:24,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-11 06:09:24,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-11 06:09:24,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-11 06:09:24,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-11 06:09:24,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-11 06:09:24,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-11 06:09:24,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-11 06:09:24,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-11 06:09:24,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-11 06:09:24,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-11 06:09:24,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-11 06:09:24,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-11 06:09:24,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-11 06:09:24,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-11 06:09:24,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-11 06:09:24,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-11 06:09:24,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-11 06:09:24,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-11 06:09:24,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-11 06:09:24,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-11 06:09:24,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-11 06:09:24,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-11 06:09:24,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-11 06:09:24,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-11 06:09:24,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-11 06:09:24,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-11 06:09:24,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-11 06:09:24,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-11 06:09:24,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-11 06:09:24,545 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-NewStatesSleepPersistent-NoLbe.epf [2022-02-11 06:09:24,567 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-11 06:09:24,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-11 06:09:24,567 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-11 06:09:24,567 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-11 06:09:24,568 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-11 06:09:24,568 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-11 06:09:24,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-11 06:09:24,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-11 06:09:24,569 INFO L138 SettingsManager]: * Use SBE=true [2022-02-11 06:09:24,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-11 06:09:24,569 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-11 06:09:24,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-11 06:09:24,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-11 06:09:24,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-11 06:09:24,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-11 06:09:24,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-11 06:09:24,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-11 06:09:24,570 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-11 06:09:24,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-11 06:09:24,570 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-11 06:09:24,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-11 06:09:24,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-11 06:09:24,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-11 06:09:24,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-11 06:09:24,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-11 06:09:24,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-11 06:09:24,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-11 06:09:24,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-11 06:09:24,571 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-11 06:09:24,571 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-11 06:09:24,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-11 06:09:24,571 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-11 06:09:24,571 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-11 06:09:24,571 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-11 06:09:24,571 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-02-11 06:09:24,572 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2022-02-11 06:09:24,572 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-11 06:09:24,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-11 06:09:24,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-11 06:09:24,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-11 06:09:24,781 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-02-11 06:09:24,781 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-02-11 06:09:24,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl [2022-02-11 06:09:24,783 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl' [2022-02-11 06:09:24,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-11 06:09:24,808 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-11 06:09:24,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-11 06:09:24,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-11 06:09:24,809 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-11 06:09:24,818 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 11.02 06:09:24" (1/1) ... [2022-02-11 06:09:24,823 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 11.02 06:09:24" (1/1) ... [2022-02-11 06:09:24,833 INFO L137 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-02-11 06:09:24,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-11 06:09:24,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-11 06:09:24,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-11 06:09:24,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-11 06:09:24,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 06:09:24" (1/1) ... [2022-02-11 06:09:24,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 06:09:24" (1/1) ... [2022-02-11 06:09:24,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 06:09:24" (1/1) ... [2022-02-11 06:09:24,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 06:09:24" (1/1) ... [2022-02-11 06:09:24,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 06:09:24" (1/1) ... [2022-02-11 06:09:24,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 06:09:24" (1/1) ... [2022-02-11 06:09:24,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 06:09:24" (1/1) ... [2022-02-11 06:09:24,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-11 06:09:24,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-11 06:09:24,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-11 06:09:24,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-11 06:09:24,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 06:09:24" (1/1) ... [2022-02-11 06:09:24,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-11 06:09:24,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 06:09:24,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-11 06:09:24,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-11 06:09:24,914 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-02-11 06:09:24,914 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-11 06:09:24,914 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-11 06:09:24,914 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-02-11 06:09:24,914 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-11 06:09:24,914 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-11 06:09:24,914 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-02-11 06:09:24,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-11 06:09:24,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-11 06:09:24,914 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-02-11 06:09:24,915 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-02-11 06:09:24,915 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-02-11 06:09:24,915 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2022-02-11 06:09:24,915 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-02-11 06:09:24,915 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-02-11 06:09:24,915 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2022-02-11 06:09:24,915 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-02-11 06:09:24,915 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-02-11 06:09:24,915 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2022-02-11 06:09:24,915 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-02-11 06:09:24,915 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-02-11 06:09:24,916 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-11 06:09:24,953 INFO L234 CfgBuilder]: Building ICFG [2022-02-11 06:09:24,954 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-11 06:09:25,061 INFO L275 CfgBuilder]: Performing block encoding [2022-02-11 06:09:25,070 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-11 06:09:25,070 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-11 06:09:25,088 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.02 06:09:25 BoogieIcfgContainer [2022-02-11 06:09:25,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-11 06:09:25,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-11 06:09:25,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-11 06:09:25,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-11 06:09:25,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 06:09:24" (1/2) ... [2022-02-11 06:09:25,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9f6f2a and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.02 06:09:25, skipping insertion in model container [2022-02-11 06:09:25,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.02 06:09:25" (2/2) ... [2022-02-11 06:09:25,102 INFO L112 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2022-02-11 06:09:25,106 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-11 06:09:25,106 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-11 06:09:25,106 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-11 06:09:25,106 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-11 06:09:25,190 INFO L148 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-02-11 06:09:25,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-11 06:09:25,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 06:09:25,249 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-11 06:09:25,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-02-11 06:09:25,273 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread4Thread1of1ForFork3 ======== [2022-02-11 06:09:25,278 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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 [2022-02-11 06:09:25,278 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-11 06:09:25,721 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err4INUSE_VIOLATION (1 of 2 remaining) [2022-02-11 06:09:25,721 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err6INUSE_VIOLATION (0 of 2 remaining) [2022-02-11 06:09:25,731 INFO L733 BasicCegarLoop]: Path program histogram: [] [2022-02-11 06:09:25,732 INFO L313 ceAbstractionStarter]: Result for error location thread4Thread1of1ForFork3 was SAFE,SAFE (1/3) [2022-02-11 06:09:25,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-11 06:09:25,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 06:09:25,741 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-11 06:09:25,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-02-11 06:09:25,746 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-02-11 06:09:25,747 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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 [2022-02-11 06:09:25,747 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-11 06:09:25,962 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr9INUSE_VIOLATION] === [2022-02-11 06:09:25,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 06:09:25,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1927946499, now seen corresponding path program 1 times [2022-02-11 06:09:25,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 06:09:25,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037856830] [2022-02-11 06:09:25,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 06:09:25,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 06:09:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 06:09:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2022-02-11 06:09:26,182 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 06:09:26,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037856830] [2022-02-11 06:09:26,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037856830] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 06:09:26,183 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 06:09:26,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-11 06:09:26,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047805177] [2022-02-11 06:09:26,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 06:09:26,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 06:09:26,190 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 06:09:26,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 06:09:26,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-11 06:09:26,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 06:09:26,221 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 06:09:26,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 06:09:26,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 06:09:26,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:26,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-11 06:09:26,336 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr9INUSE_VIOLATION] === [2022-02-11 06:09:26,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 06:09:26,336 INFO L85 PathProgramCache]: Analyzing trace with hash 480568168, now seen corresponding path program 2 times [2022-02-11 06:09:26,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 06:09:26,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591770694] [2022-02-11 06:09:26,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 06:09:26,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 06:09:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 06:09:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-11 06:09:26,385 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 06:09:26,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591770694] [2022-02-11 06:09:26,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591770694] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 06:09:26,386 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 06:09:26,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-11 06:09:26,386 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281055978] [2022-02-11 06:09:26,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 06:09:26,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 06:09:26,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 06:09:26,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 06:09:26,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-11 06:09:26,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 06:09:26,388 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 06:09:26,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 06:09:26,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:26,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 06:09:26,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:26,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-11 06:09:26,806 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr9INUSE_VIOLATION] === [2022-02-11 06:09:26,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 06:09:26,806 INFO L85 PathProgramCache]: Analyzing trace with hash 811978713, now seen corresponding path program 1 times [2022-02-11 06:09:26,806 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 06:09:26,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743924016] [2022-02-11 06:09:26,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 06:09:26,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 06:09:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 06:09:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-02-11 06:09:26,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 06:09:26,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743924016] [2022-02-11 06:09:26,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743924016] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 06:09:26,857 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 06:09:26,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-11 06:09:26,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885284210] [2022-02-11 06:09:26,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 06:09:26,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 06:09:26,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 06:09:26,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 06:09:26,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-11 06:09:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 06:09:26,859 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 06:09:26,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 06:09:26,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:26,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:26,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 06:09:27,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-11 06:09:27,075 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr9INUSE_VIOLATION] === [2022-02-11 06:09:27,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 06:09:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash -376392044, now seen corresponding path program 2 times [2022-02-11 06:09:27,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 06:09:27,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343154343] [2022-02-11 06:09:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 06:09:27,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 06:09:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 06:09:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-02-11 06:09:27,122 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 06:09:27,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343154343] [2022-02-11 06:09:27,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343154343] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 06:09:27,123 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 06:09:27,123 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-11 06:09:27,123 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744969339] [2022-02-11 06:09:27,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 06:09:27,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 06:09:27,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 06:09:27,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 06:09:27,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-11 06:09:27,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 06:09:27,124 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 06:09:27,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 06:09:27,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 06:09:27,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-11 06:09:27,307 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr9INUSE_VIOLATION] === [2022-02-11 06:09:27,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 06:09:27,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1907870225, now seen corresponding path program 3 times [2022-02-11 06:09:27,307 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 06:09:27,307 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829153765] [2022-02-11 06:09:27,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 06:09:27,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 06:09:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 06:09:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-11 06:09:27,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 06:09:27,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829153765] [2022-02-11 06:09:27,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829153765] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 06:09:27,336 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 06:09:27,336 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-11 06:09:27,336 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969323867] [2022-02-11 06:09:27,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 06:09:27,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 06:09:27,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 06:09:27,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 06:09:27,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-11 06:09:27,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 06:09:27,338 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 06:09:27,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 06:09:27,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 06:09:27,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-11 06:09:27,381 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr9INUSE_VIOLATION] === [2022-02-11 06:09:27,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 06:09:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1284579926, now seen corresponding path program 4 times [2022-02-11 06:09:27,383 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 06:09:27,383 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734147648] [2022-02-11 06:09:27,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 06:09:27,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 06:09:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 06:09:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-11 06:09:27,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 06:09:27,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734147648] [2022-02-11 06:09:27,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734147648] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 06:09:27,425 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 06:09:27,425 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-11 06:09:27,425 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835608026] [2022-02-11 06:09:27,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 06:09:27,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 06:09:27,426 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 06:09:27,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 06:09:27,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-11 06:09:27,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 06:09:27,427 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 06:09:27,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 06:09:27,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 06:09:27,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:27,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-11 06:09:27,460 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr9INUSE_VIOLATION] === [2022-02-11 06:09:27,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 06:09:27,460 INFO L85 PathProgramCache]: Analyzing trace with hash -36353531, now seen corresponding path program 5 times [2022-02-11 06:09:27,460 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 06:09:27,460 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212996514] [2022-02-11 06:09:27,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 06:09:27,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 06:09:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 06:09:27,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 06:09:27,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 06:09:27,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212996514] [2022-02-11 06:09:27,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212996514] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 06:09:27,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105623557] [2022-02-11 06:09:27,795 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-11 06:09:27,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 06:09:27,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 06:09:27,836 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 06:09:27,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-11 06:09:27,886 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-11 06:09:27,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 06:09:27,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-11 06:09:27,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 06:09:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 06:09:28,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 06:09:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 06:09:28,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105623557] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 06:09:28,638 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 06:09:28,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2022-02-11 06:09:28,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477343305] [2022-02-11 06:09:28,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 06:09:28,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-11 06:09:28,638 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 06:09:28,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-11 06:09:28,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2022-02-11 06:09:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 06:09:28,639 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 06:09:28,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 06:09:28,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:28,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:28,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:28,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:28,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:28,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:28,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 06:09:29,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:29,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 06:09:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-11 06:09:29,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-11 06:09:29,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 06:09:29,281 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr9INUSE_VIOLATION] === [2022-02-11 06:09:29,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 06:09:29,281 INFO L85 PathProgramCache]: Analyzing trace with hash 330753443, now seen corresponding path program 6 times [2022-02-11 06:09:29,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 06:09:29,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360424885] [2022-02-11 06:09:29,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 06:09:29,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 06:09:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-11 06:09:29,291 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-11 06:09:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-11 06:09:29,340 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-11 06:09:29,340 INFO L629 BasicCegarLoop]: Counterexample is feasible [2022-02-11 06:09:29,340 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2022-02-11 06:09:29,341 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8INUSE_VIOLATION (1 of 3 remaining) [2022-02-11 06:09:29,341 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9INUSE_VIOLATION (0 of 3 remaining) [2022-02-11 06:09:29,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-11 06:09:29,342 INFO L733 BasicCegarLoop]: Path program histogram: [6, 2] [2022-02-11 06:09:29,342 INFO L313 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/3) [2022-02-11 06:09:29,344 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-11 06:09:29,344 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-11 06:09:29,377 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.02 06:09:29 BasicIcfg [2022-02-11 06:09:29,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-11 06:09:29,378 INFO L158 Benchmark]: Toolchain (without parser) took 4570.26ms. Allocated memory was 178.3MB in the beginning and 337.6MB in the end (delta: 159.4MB). Free memory was 136.1MB in the beginning and 235.2MB in the end (delta: -99.1MB). Peak memory consumption was 61.0MB. Max. memory is 8.0GB. [2022-02-11 06:09:29,378 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-11 06:09:29,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.66ms. Allocated memory is still 178.3MB. Free memory was 136.0MB in the beginning and 134.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-11 06:09:29,379 INFO L158 Benchmark]: Boogie Preprocessor took 26.03ms. Allocated memory is still 178.3MB. Free memory was 134.5MB in the beginning and 133.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-11 06:09:29,379 INFO L158 Benchmark]: RCFGBuilder took 226.49ms. Allocated memory is still 178.3MB. Free memory was 133.4MB in the beginning and 123.3MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-02-11 06:09:29,385 INFO L158 Benchmark]: TraceAbstraction took 4287.92ms. Allocated memory was 178.3MB in the beginning and 337.6MB in the end (delta: 159.4MB). Free memory was 122.8MB in the beginning and 235.2MB in the end (delta: -112.3MB). Peak memory consumption was 47.3MB. Max. memory is 8.0GB. [2022-02-11 06:09:29,386 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.66ms. Allocated memory is still 178.3MB. Free memory was 136.0MB in the beginning and 134.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.03ms. Allocated memory is still 178.3MB. Free memory was 134.5MB in the beginning and 133.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 226.49ms. Allocated memory is still 178.3MB. Free memory was 133.4MB in the beginning and 123.3MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 4287.92ms. Allocated memory was 178.3MB in the beginning and 337.6MB in the end (delta: 159.4MB). Free memory was 122.8MB in the beginning and 235.2MB in the end (delta: -112.3MB). Peak memory consumption was 47.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6620, positive: 6412, positive conditional: 1837, positive unconditional: 4575, negative: 208, negative conditional: 169, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6505, positive: 6412, positive conditional: 1837, positive unconditional: 4575, negative: 93, negative conditional: 54, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6505, positive: 6412, positive conditional: 1837, positive unconditional: 4575, negative: 93, negative conditional: 54, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6505, positive: 6412, positive conditional: 0, positive unconditional: 6412, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6505, positive: 6412, positive conditional: 0, positive unconditional: 6412, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6505, positive: 6412, positive conditional: 0, positive unconditional: 6412, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4056, positive: 4017, positive conditional: 0, positive unconditional: 4017, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4056, positive: 3990, positive conditional: 0, positive unconditional: 3990, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 144, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6505, positive: 2395, positive conditional: 0, positive unconditional: 2395, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 4056, unknown conditional: 0, unknown unconditional: 4056] , Statistics on independence cache: Total cache size (in pairs): 4056, Positive cache size: 4017, Positive conditional cache size: 0, Positive unconditional cache size: 4017, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 115 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 331, Number of trivial persistent sets: 313, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4614, positive: 4575, positive conditional: 0, positive unconditional: 4575, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6620, positive: 6412, positive conditional: 1837, positive unconditional: 4575, negative: 208, negative conditional: 169, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6505, positive: 6412, positive conditional: 1837, positive unconditional: 4575, negative: 93, negative conditional: 54, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6505, positive: 6412, positive conditional: 1837, positive unconditional: 4575, negative: 93, negative conditional: 54, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6505, positive: 6412, positive conditional: 0, positive unconditional: 6412, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6505, positive: 6412, positive conditional: 0, positive unconditional: 6412, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6505, positive: 6412, positive conditional: 0, positive unconditional: 6412, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4056, positive: 4017, positive conditional: 0, positive unconditional: 4017, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4056, positive: 3990, positive conditional: 0, positive unconditional: 3990, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 144, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6505, positive: 2395, positive conditional: 0, positive unconditional: 2395, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 4056, unknown conditional: 0, unknown unconditional: 4056] , Statistics on independence cache: Total cache size (in pairs): 4056, Positive cache size: 4017, Positive conditional cache size: 0, Positive unconditional cache size: 4017, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 115 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 53249, positive: 48650, positive conditional: 42808, positive unconditional: 5842, negative: 4599, negative conditional: 4547, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49737, positive: 48650, positive conditional: 42808, positive unconditional: 5842, negative: 1087, negative conditional: 1035, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49737, positive: 48650, positive conditional: 42808, positive unconditional: 5842, negative: 1087, negative conditional: 1035, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51498, positive: 48650, positive conditional: 37991, positive unconditional: 10659, negative: 2848, negative conditional: 1761, negative unconditional: 1087, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51498, positive: 48650, positive conditional: 5263, positive unconditional: 43387, negative: 2848, negative conditional: 130, negative unconditional: 2718, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51498, positive: 48650, positive conditional: 5263, positive unconditional: 43387, negative: 2848, negative conditional: 130, negative unconditional: 2718, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4709, positive: 4651, positive conditional: 2, positive unconditional: 4649, negative: 58, negative conditional: 6, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4709, positive: 4616, positive conditional: 0, positive unconditional: 4616, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, positive: 35, positive conditional: 2, positive unconditional: 33, negative: 58, negative conditional: 6, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 140, positive: 40, positive conditional: 2, positive unconditional: 39, negative: 100, negative conditional: 7, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51498, positive: 43999, positive conditional: 5261, positive unconditional: 38738, negative: 2790, negative conditional: 124, negative unconditional: 2666, unknown: 4709, unknown conditional: 8, unknown unconditional: 4701] , Statistics on independence cache: Total cache size (in pairs): 4709, Positive cache size: 4651, Positive conditional cache size: 2, Positive unconditional cache size: 4649, Negative cache size: 58, Negative conditional cache size: 6, Negative unconditional cache size: 52, Eliminated conditions: 34359, Maximal queried relation: 4, Independence queries for same thread: 3512 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 5051, Number of trivial persistent sets: 4905, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5894, positive: 5842, positive conditional: 0, positive unconditional: 5842, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 53249, positive: 48650, positive conditional: 42808, positive unconditional: 5842, negative: 4599, negative conditional: 4547, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49737, positive: 48650, positive conditional: 42808, positive unconditional: 5842, negative: 1087, negative conditional: 1035, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49737, positive: 48650, positive conditional: 42808, positive unconditional: 5842, negative: 1087, negative conditional: 1035, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51498, positive: 48650, positive conditional: 37991, positive unconditional: 10659, negative: 2848, negative conditional: 1761, negative unconditional: 1087, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51498, positive: 48650, positive conditional: 5263, positive unconditional: 43387, negative: 2848, negative conditional: 130, negative unconditional: 2718, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51498, positive: 48650, positive conditional: 5263, positive unconditional: 43387, negative: 2848, negative conditional: 130, negative unconditional: 2718, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4709, positive: 4651, positive conditional: 2, positive unconditional: 4649, negative: 58, negative conditional: 6, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4709, positive: 4616, positive conditional: 0, positive unconditional: 4616, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, positive: 35, positive conditional: 2, positive unconditional: 33, negative: 58, negative conditional: 6, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 140, positive: 40, positive conditional: 2, positive unconditional: 39, negative: 100, negative conditional: 7, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51498, positive: 43999, positive conditional: 5261, positive unconditional: 38738, negative: 2790, negative conditional: 124, negative unconditional: 2666, unknown: 4709, unknown conditional: 8, unknown unconditional: 4701] , Statistics on independence cache: Total cache size (in pairs): 4709, Positive cache size: 4651, Positive conditional cache size: 2, Positive unconditional cache size: 4649, Negative cache size: 58, Negative conditional cache size: 6, Negative unconditional cache size: 52, Eliminated conditions: 34359, Maximal queried relation: 4, Independence queries for same thread: 3512 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 121]: assertion can be violated assertion can be violated We found a FailurePath: [L115] 0 assume x_0 == x_8 && y_1 == y_9; VAL [x_0=-3, x_8=-3, y_1=-1, y_9=-1] [L116] FORK 0 fork 1 thread1(); VAL [x_0=-3, x_8=-3, y_1=-1, y_9=-1] [L117] FORK 0 fork 4, 4, 4, 4 thread4(); VAL [x_0=-3, x_8=-3, 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=-3, x_8=-3, y_1=-1, y_9=-1] [L63] FORK 1 fork 2, 2 thread2(); VAL [f1_2=false, f2_3=false, x_0=-3, x_8=-3, 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=-3, x_8=-3, 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=-3, x_8=-3, 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=-3, x_0=-3, x_8=-3, 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=-3, x_0=-2, x_8=-3, 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=-3, x_0=-2, x_8=-3, y_1=-1, y_9=-1] [L73] 4 temp_12 := x_8; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, x_0=-2, x_8=-3, y_1=-1, y_9=-1] [L74] 4 x_8 := temp_12 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, x_0=-2, x_8=-2, y_1=-1, y_9=-1] [L75] 4 f1_10 := true; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, x_0=-2, x_8=-2, y_1=-1, y_9=-1] [L64] FORK 1 fork 3, 3, 3 thread3(); VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, x_0=-2, x_8=-2, y_1=-1, y_9=-1] [L45] 5 temp_6 := y_1; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, temp_6=-1, x_0=-2, x_8=-2, y_1=-1, y_9=-1] [L46] 5 y_1 := temp_6 + 1; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, temp_6=-1, x_0=-2, x_8=-2, y_1=0, y_9=-1] [L47] 5 f2_3 := true; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_4=-3, temp_6=-1, x_0=-2, x_8=-2, y_1=0, y_9=-1] [L33] 3 assume f2_3; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_4=-3, temp_6=-1, x_0=-2, x_8=-2, y_1=0, y_9=-1] [L34] 3 temp_5 := y_1; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_4=-3, temp_5=0, temp_6=-1, x_0=-2, x_8=-2, y_1=0, y_9=-1] [L35] 3 y_1 := temp_5 + 1; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_4=-3, temp_5=0, temp_6=-1, x_0=-2, x_8=-2, y_1=1, y_9=-1] [L48] 5 assume f1_2; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_4=-3, temp_5=0, temp_6=-1, x_0=-2, x_8=-2, y_1=1, y_9=-1] [L36] 3 f1_2 := false; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=true, temp_12=-3, temp_4=-3, temp_5=0, temp_6=-1, x_0=-2, x_8=-2, y_1=1, y_9=-1] [L49] 5 temp_7 := x_0; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=true, temp_12=-3, temp_4=-3, temp_5=0, temp_6=-1, temp_7=-2, x_0=-2, x_8=-2, y_1=1, y_9=-1] [L50] 5 x_0 := temp_7 + 1; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=true, temp_12=-3, temp_4=-3, temp_5=0, temp_6=-1, temp_7=-2, x_0=-1, x_8=-2, y_1=1, y_9=-1] [L51] 5 f2_3 := false; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, temp_5=0, temp_6=-1, temp_7=-2, x_0=-1, x_8=-2, y_1=1, y_9=-1] [L37] 3 assume !f2_3; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, temp_5=0, temp_6=-1, temp_7=-2, x_0=-1, x_8=-2, y_1=1, y_9=-1] [L30] 3 temp_4 := x_0; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_4=-1, temp_5=0, temp_6=-1, temp_7=-2, x_0=-1, x_8=-2, y_1=1, y_9=-1] [L31] 3 x_0 := temp_4 + 1; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_4=-1, temp_5=0, temp_6=-1, temp_7=-2, x_0=0, x_8=-2, y_1=1, y_9=-1] [L52] 5 assume !f1_2; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_4=-1, temp_5=0, temp_6=-1, temp_7=-2, x_0=0, x_8=-2, y_1=1, y_9=-1] [L32] 3 f1_2 := true; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-1, temp_5=0, temp_6=-1, temp_7=-2, x_0=0, x_8=-2, y_1=1, y_9=-1] [L45] 5 temp_6 := y_1; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-1, temp_5=0, temp_6=1, temp_7=-2, x_0=0, x_8=-2, y_1=1, y_9=-1] [L46] 5 y_1 := temp_6 + 1; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-3, temp_4=-1, temp_5=0, temp_6=1, temp_7=-2, x_0=0, x_8=-2, y_1=2, y_9=-1] [L47] 5 f2_3 := true; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_4=-1, temp_5=0, temp_6=1, temp_7=-2, x_0=0, x_8=-2, y_1=2, y_9=-1] [L33] 3 assume f2_3; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_4=-1, temp_5=0, temp_6=1, temp_7=-2, x_0=0, x_8=-2, y_1=2, y_9=-1] [L34] 3 temp_5 := y_1; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_4=-1, temp_5=2, temp_6=1, temp_7=-2, x_0=0, x_8=-2, y_1=2, y_9=-1] [L35] 3 y_1 := temp_5 + 1; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_4=-1, temp_5=2, temp_6=1, temp_7=-2, x_0=0, x_8=-2, y_1=3, y_9=-1] [L48] 5 assume f1_2; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-3, temp_4=-1, temp_5=2, temp_6=1, temp_7=-2, x_0=0, x_8=-2, y_1=3, y_9=-1] [L36] 3 f1_2 := false; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=true, temp_12=-3, temp_4=-1, temp_5=2, temp_6=1, temp_7=-2, x_0=0, x_8=-2, y_1=3, y_9=-1] [L49] 5 temp_7 := x_0; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=true, temp_12=-3, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=0, x_8=-2, y_1=3, y_9=-1] [L50] 5 x_0 := temp_7 + 1; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=true, temp_12=-3, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-2, y_1=3, y_9=-1] [L51] 5 f2_3 := false; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-2, y_1=3, y_9=-1] [L37] 3 assume !f2_3; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-2, y_1=3, y_9=-1] [L52] 5 assume !f1_2; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-2, y_1=3, y_9=-1] [L107] FORK 2 fork 6, 6, 6, 6, 6, 6 thread6(); VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-2, 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=-3, temp_14=-1, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-2, 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=-3, temp_14=-1, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-2, 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=-3, temp_14=-1, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-2, y_1=3, y_9=0] [L76] 4 assume f2_11; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_14=-1, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-2, y_1=3, y_9=0] [L77] 4 temp_13 := y_9; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_13=0, temp_14=-1, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-2, y_1=3, y_9=0] [L78] 4 y_9 := temp_13 + 1; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_13=0, temp_14=-1, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-2, 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=-3, temp_13=0, temp_14=-1, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-2, y_1=3, y_9=1] [L79] 4 f1_10 := false; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_13=0, temp_14=-1, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-2, 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=-3, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-2, 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=-3, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, 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=-3, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-1, y_1=3, y_9=1] [L80] 4 assume !f2_11; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, 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=-3, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, 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=-3, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-1, y_1=3, y_9=1] [L66] JOIN 5 join 3, 3, 3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, 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=-3, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-1, y_1=3, y_9=1] [L108] JOIN 4 join 5, 5, 5, 5, 5; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, 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=-3, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, 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=-3, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, 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=-3, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, 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=-3, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-1, temp_5=2, temp_6=1, temp_7=0, x_0=1, x_8=-1, y_1=3, y_9=1] - 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. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread4Thread1of1ForFork3 with 1 thread instances CFG has 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.4s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 1.7s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 695 NumberOfCodeBlocks, 695 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 670 ConstructedInterpolants, 0 QuantifiedInterpolants, 2556 SizeOfPredicates, 16 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 407/419 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-11 06:09:29,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2022-02-11 06:09:29,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2022-02-11 06:09:29,821 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...