/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/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps X --traceabstraction.defines.what.statements.are.considered.a.step.in.por LOOP -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.orders-32214ab [2023-05-19 20:15:46,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-19 20:15:46,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-19 20:15:46,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-19 20:15:46,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-19 20:15:46,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-19 20:15:46,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-19 20:15:46,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-19 20:15:46,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-19 20:15:46,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-19 20:15:46,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-19 20:15:46,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-19 20:15:46,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-19 20:15:46,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-19 20:15:46,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-19 20:15:46,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-19 20:15:46,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-19 20:15:46,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-19 20:15:46,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-19 20:15:46,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-19 20:15:46,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-19 20:15:46,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-19 20:15:46,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-19 20:15:46,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-19 20:15:46,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-19 20:15:46,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-19 20:15:46,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-19 20:15:46,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-19 20:15:46,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-19 20:15:46,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-19 20:15:46,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-19 20:15:46,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-19 20:15:46,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-19 20:15:46,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-19 20:15:46,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-19 20:15:46,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-19 20:15:46,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-19 20:15:46,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-19 20:15:46,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-19 20:15:46,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-19 20:15:46,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-19 20:15:46,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-19 20:15:46,092 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-19 20:15:46,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-19 20:15:46,092 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-19 20:15:46,093 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-19 20:15:46,093 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-19 20:15:46,093 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-19 20:15:46,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-19 20:15:46,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-19 20:15:46,094 INFO L138 SettingsManager]: * Use SBE=true [2023-05-19 20:15:46,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-19 20:15:46,094 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-19 20:15:46,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-19 20:15:46,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-19 20:15:46,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-19 20:15:46,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-19 20:15:46,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-19 20:15:46,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-19 20:15:46,094 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-19 20:15:46,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-19 20:15:46,095 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-19 20:15:46,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-19 20:15:46,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-19 20:15:46,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-19 20:15:46,095 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-19 20:15:46,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-19 20:15:46,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-19 20:15:46,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-19 20:15:46,095 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-19 20:15:46,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-19 20:15:46,095 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-19 20:15:46,096 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-19 20:15:46,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-19 20:15:46,096 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-19 20:15:46,096 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-19 20:15:46,096 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-19 20:15:46,096 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-19 20:15:46,096 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-19 20:15:46,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-19 20:15:46,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-19 20:15:46,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-19 20:15:46,277 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-05-19 20:15:46,279 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2023-05-19 20:15:46,280 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 [2023-05-19 20:15:46,280 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl' [2023-05-19 20:15:46,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-19 20:15:46,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-05-19 20:15:46,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-19 20:15:46,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-19 20:15:46,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-19 20:15:46,320 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 19.05 08:15:46" (1/1) ... [2023-05-19 20:15:46,343 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 19.05 08:15:46" (1/1) ... [2023-05-19 20:15:46,350 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-05-19 20:15:46,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-19 20:15:46,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-19 20:15:46,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-19 20:15:46,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-19 20:15:46,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.05 08:15:46" (1/1) ... [2023-05-19 20:15:46,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.05 08:15:46" (1/1) ... [2023-05-19 20:15:46,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.05 08:15:46" (1/1) ... [2023-05-19 20:15:46,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.05 08:15:46" (1/1) ... [2023-05-19 20:15:46,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.05 08:15:46" (1/1) ... [2023-05-19 20:15:46,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.05 08:15:46" (1/1) ... [2023-05-19 20:15:46,373 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.05 08:15:46" (1/1) ... [2023-05-19 20:15:46,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.05 08:15:46" (1/1) ... [2023-05-19 20:15:46,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-19 20:15:46,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-19 20:15:46,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-19 20:15:46,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-19 20:15:46,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.05 08:15:46" (1/1) ... [2023-05-19 20:15:46,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-19 20:15:46,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 20:15:46,399 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) [2023-05-19 20:15:46,408 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 [2023-05-19 20:15:46,437 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-05-19 20:15:46,437 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-19 20:15:46,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-19 20:15:46,437 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-05-19 20:15:46,437 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-19 20:15:46,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-19 20:15:46,437 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-05-19 20:15:46,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-19 20:15:46,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-19 20:15:46,438 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-05-19 20:15:46,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-05-19 20:15:46,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-05-19 20:15:46,438 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-05-19 20:15:46,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-05-19 20:15:46,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-05-19 20:15:46,438 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2023-05-19 20:15:46,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-05-19 20:15:46,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-05-19 20:15:46,438 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2023-05-19 20:15:46,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-05-19 20:15:46,439 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-05-19 20:15:46,439 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-19 20:15:46,481 INFO L235 CfgBuilder]: Building ICFG [2023-05-19 20:15:46,482 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-19 20:15:46,610 INFO L276 CfgBuilder]: Performing block encoding [2023-05-19 20:15:46,621 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-19 20:15:46,621 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-05-19 20:15:46,622 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.05 08:15:46 BoogieIcfgContainer [2023-05-19 20:15:46,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-19 20:15:46,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-19 20:15:46,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-19 20:15:46,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-19 20:15:46,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.05 08:15:46" (1/2) ... [2023-05-19 20:15:46,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ce75e2 and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.05 08:15:46, skipping insertion in model container [2023-05-19 20:15:46,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.05 08:15:46" (2/2) ... [2023-05-19 20:15:46,637 INFO L112 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2023-05-19 20:15:46,642 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-19 20:15:46,647 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-19 20:15:46,648 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-19 20:15:46,648 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-19 20:15:46,736 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-05-19 20:15:46,765 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-19 20:15:46,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-19 20:15:46,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 20:15:46,767 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) [2023-05-19 20:15:46,767 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 [2023-05-19 20:15:46,790 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-19 20:15:46,803 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread4Thread1of1ForFork3 ======== [2023-05-19 20:15:46,807 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@a440e1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-19 20:15:46,807 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-19 20:15:47,576 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-05-19 20:15:47,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-05-19 20:15:47,583 INFO L444 BasicCegarLoop]: Path program histogram: [] [2023-05-19 20:15:47,585 INFO L307 ceAbstractionStarter]: Result for error location thread4Thread1of1ForFork3 was SAFE,SAFE (1/3) [2023-05-19 20:15:47,589 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-19 20:15:47,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-19 20:15:47,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 20:15:47,590 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) [2023-05-19 20:15:47,593 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 [2023-05-19 20:15:47,613 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-19 20:15:47,614 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-19 20:15:47,615 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@a440e1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-19 20:15:47,615 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-19 20:15:47,789 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 20:15:47,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 20:15:47,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1492472103, now seen corresponding path program 1 times [2023-05-19 20:15:47,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 20:15:47,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232982157] [2023-05-19 20:15:47,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 20:15:47,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 20:15:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 20:15:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-05-19 20:15:47,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 20:15:47,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232982157] [2023-05-19 20:15:47,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232982157] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 20:15:47,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-19 20:15:47,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-19 20:15:47,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578023186] [2023-05-19 20:15:47,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 20:15:47,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-19 20:15:47,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 20:15:47,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-19 20:15:47,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-19 20:15:47,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 20:15:47,978 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 20:15:47,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-19 20:15:47,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 20:15:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-19 20:15:48,076 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 20:15:48,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 20:15:48,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1421888882, now seen corresponding path program 2 times [2023-05-19 20:15:48,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 20:15:48,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058151331] [2023-05-19 20:15:48,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 20:15:48,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 20:15:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 20:15:48,136 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-19 20:15:48,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 20:15:48,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058151331] [2023-05-19 20:15:48,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058151331] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 20:15:48,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-19 20:15:48,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-19 20:15:48,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867861076] [2023-05-19 20:15:48,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 20:15:48,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-19 20:15:48,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 20:15:48,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-19 20:15:48,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-19 20:15:48,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 20:15:48,138 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 20:15:48,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-19 20:15:48,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 20:15:48,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-19 20:15:48,233 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 20:15:48,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 20:15:48,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1790154631, now seen corresponding path program 3 times [2023-05-19 20:15:48,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 20:15:48,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883393651] [2023-05-19 20:15:48,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 20:15:48,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 20:15:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 20:15:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-19 20:15:48,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 20:15:48,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883393651] [2023-05-19 20:15:48,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883393651] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 20:15:48,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-19 20:15:48,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-19 20:15:48,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539441505] [2023-05-19 20:15:48,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 20:15:48,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-19 20:15:48,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 20:15:48,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-19 20:15:48,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-19 20:15:48,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 20:15:48,293 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 20:15:48,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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) [2023-05-19 20:15:48,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 20:15:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-19 20:15:48,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 20:15:48,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 20:15:48,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1310862517, now seen corresponding path program 4 times [2023-05-19 20:15:48,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 20:15:48,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252287163] [2023-05-19 20:15:48,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 20:15:48,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 20:15:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 20:15:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-19 20:15:48,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 20:15:48,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252287163] [2023-05-19 20:15:48,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252287163] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 20:15:48,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-19 20:15:48,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-19 20:15:48,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17589281] [2023-05-19 20:15:48,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 20:15:48,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-19 20:15:48,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 20:15:48,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-19 20:15:48,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-19 20:15:48,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 20:15:48,405 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 20:15:48,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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) [2023-05-19 20:15:48,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 20:15:48,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-19 20:15:48,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 20:15:48,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 20:15:48,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1405896425, now seen corresponding path program 5 times [2023-05-19 20:15:48,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 20:15:48,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966061497] [2023-05-19 20:15:48,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 20:15:48,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 20:15:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 20:15:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-19 20:15:48,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 20:15:48,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966061497] [2023-05-19 20:15:48,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966061497] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 20:15:48,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-19 20:15:48,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-19 20:15:48,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694141010] [2023-05-19 20:15:48,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 20:15:48,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-19 20:15:48,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 20:15:48,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-19 20:15:48,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-19 20:15:48,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 20:15:48,594 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 20:15:48,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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) [2023-05-19 20:15:48,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 20:15:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-19 20:15:48,658 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 20:15:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 20:15:48,658 INFO L85 PathProgramCache]: Analyzing trace with hash 146021339, now seen corresponding path program 6 times [2023-05-19 20:15:48,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 20:15:48,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124667477] [2023-05-19 20:15:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 20:15:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 20:15:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 20:15:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-19 20:15:48,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 20:15:48,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124667477] [2023-05-19 20:15:48,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124667477] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 20:15:48,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-19 20:15:48,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-19 20:15:48,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824290531] [2023-05-19 20:15:48,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 20:15:48,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-19 20:15:48,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 20:15:48,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-19 20:15:48,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-19 20:15:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 20:15:48,683 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 20:15:48,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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) [2023-05-19 20:15:48,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 20:15:48,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:48,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-19 20:15:48,764 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 20:15:48,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 20:15:48,764 INFO L85 PathProgramCache]: Analyzing trace with hash -427895129, now seen corresponding path program 7 times [2023-05-19 20:15:48,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 20:15:48,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832905248] [2023-05-19 20:15:48,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 20:15:48,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 20:15:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 20:15:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-19 20:15:49,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 20:15:49,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832905248] [2023-05-19 20:15:49,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832905248] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 20:15:49,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985453023] [2023-05-19 20:15:49,297 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-05-19 20:15:49,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 20:15:49,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 20:15:49,338 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) [2023-05-19 20:15:49,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-19 20:15:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 20:15:49,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 37 conjunts are in the unsatisfiable core [2023-05-19 20:15:49,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 20:15:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-19 20:15:49,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 20:15:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-19 20:15:49,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985453023] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 20:15:49,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 20:15:49,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2023-05-19 20:15:49,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496958290] [2023-05-19 20:15:49,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 20:15:49,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-05-19 20:15:49,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 20:15:49,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-05-19 20:15:49,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2023-05-19 20:15:49,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 20:15:49,967 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 20:15:49,967 INFO L496 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) [2023-05-19 20:15:49,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:49,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:49,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:49,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:49,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:49,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:49,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 20:15:50,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:50,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:50,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:50,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:50,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:50,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 20:15:50,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-19 20:15:50,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-19 20:15:51,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 20:15:51,027 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 20:15:51,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 20:15:51,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1246963255, now seen corresponding path program 8 times [2023-05-19 20:15:51,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 20:15:51,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277357694] [2023-05-19 20:15:51,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 20:15:51,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 20:15:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-19 20:15:51,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-19 20:15:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-19 20:15:51,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-19 20:15:51,060 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-19 20:15:51,060 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2023-05-19 20:15:51,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-19 20:15:51,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-19 20:15:51,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-19 20:15:51,065 INFO L444 BasicCegarLoop]: Path program histogram: [8] [2023-05-19 20:15:51,065 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/3) [2023-05-19 20:15:51,068 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-19 20:15:51,068 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-19 20:15:51,111 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.05 08:15:51 BasicIcfg [2023-05-19 20:15:51,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-19 20:15:51,111 INFO L158 Benchmark]: Toolchain (without parser) took 4801.07ms. Allocated memory was 127.9MB in the beginning and 281.0MB in the end (delta: 153.1MB). Free memory was 91.5MB in the beginning and 231.6MB in the end (delta: -140.1MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. [2023-05-19 20:15:51,112 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 127.9MB. Free memory was 92.8MB in the beginning and 92.7MB in the end (delta: 54.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-05-19 20:15:51,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.50ms. Allocated memory is still 127.9MB. Free memory was 91.4MB in the beginning and 110.7MB in the end (delta: -19.3MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-05-19 20:15:51,112 INFO L158 Benchmark]: Boogie Preprocessor took 24.43ms. Allocated memory is still 127.9MB. Free memory was 110.7MB in the beginning and 109.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-19 20:15:51,112 INFO L158 Benchmark]: RCFGBuilder took 244.27ms. Allocated memory is still 127.9MB. Free memory was 109.4MB in the beginning and 98.5MB in the end (delta: 10.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-05-19 20:15:51,113 INFO L158 Benchmark]: TraceAbstraction took 4487.26ms. Allocated memory was 127.9MB in the beginning and 281.0MB in the end (delta: 153.1MB). Free memory was 97.3MB in the beginning and 231.6MB in the end (delta: -134.3MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. [2023-05-19 20:15:51,113 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.11ms. Allocated memory is still 127.9MB. Free memory was 92.8MB in the beginning and 92.7MB in the end (delta: 54.9kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.50ms. Allocated memory is still 127.9MB. Free memory was 91.4MB in the beginning and 110.7MB in the end (delta: -19.3MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.43ms. Allocated memory is still 127.9MB. Free memory was 110.7MB in the beginning and 109.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 244.27ms. Allocated memory is still 127.9MB. Free memory was 109.4MB in the beginning and 98.5MB in the end (delta: 10.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4487.26ms. Allocated memory was 127.9MB in the beginning and 281.0MB in the end (delta: 153.1MB). Free memory was 97.3MB in the beginning and 231.6MB in the end (delta: -134.3MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 19810, independent: 18122, independent conditional: 13634, independent unconditional: 4488, dependent: 1688, dependent conditional: 1649, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18546, independent: 18122, independent conditional: 13634, independent unconditional: 4488, dependent: 424, dependent conditional: 385, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18546, independent: 18122, independent conditional: 13634, independent unconditional: 4488, dependent: 424, dependent conditional: 385, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18546, independent: 18122, independent conditional: 0, independent unconditional: 18122, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18546, independent: 18122, independent conditional: 0, independent unconditional: 18122, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18546, independent: 18122, independent conditional: 0, independent unconditional: 18122, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3822, independent: 3783, independent conditional: 0, independent unconditional: 3783, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3822, independent: 3756, independent conditional: 0, independent unconditional: 3756, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 66, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 134, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 18546, independent: 14339, independent conditional: 0, independent unconditional: 14339, dependent: 385, dependent conditional: 0, dependent unconditional: 385, unknown: 3822, unknown conditional: 0, unknown unconditional: 3822] , Statistics on independence cache: Total cache size (in pairs): 3822, Positive cache size: 3783, Positive conditional cache size: 0, Positive unconditional cache size: 3783, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 1264 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 2078, Number of trivial persistent sets: 1043, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4527, independent: 4488, independent conditional: 0, independent unconditional: 4488, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 19810, independent: 18122, independent conditional: 13634, independent unconditional: 4488, dependent: 1688, dependent conditional: 1649, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18546, independent: 18122, independent conditional: 13634, independent unconditional: 4488, dependent: 424, dependent conditional: 385, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18546, independent: 18122, independent conditional: 13634, independent unconditional: 4488, dependent: 424, dependent conditional: 385, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18546, independent: 18122, independent conditional: 0, independent unconditional: 18122, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18546, independent: 18122, independent conditional: 0, independent unconditional: 18122, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18546, independent: 18122, independent conditional: 0, independent unconditional: 18122, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3822, independent: 3783, independent conditional: 0, independent unconditional: 3783, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3822, independent: 3756, independent conditional: 0, independent unconditional: 3756, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 66, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 134, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 18546, independent: 14339, independent conditional: 0, independent unconditional: 14339, dependent: 385, dependent conditional: 0, dependent unconditional: 385, unknown: 3822, unknown conditional: 0, unknown unconditional: 3822] , Statistics on independence cache: Total cache size (in pairs): 3822, Positive cache size: 3783, Positive conditional cache size: 0, Positive unconditional cache size: 3783, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 1264 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 23955, independent: 22411, independent conditional: 16731, independent unconditional: 5680, dependent: 1544, dependent conditional: 1492, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22908, independent: 22411, independent conditional: 16731, independent unconditional: 5680, dependent: 497, dependent conditional: 445, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22908, independent: 22411, independent conditional: 16731, independent unconditional: 5680, dependent: 497, dependent conditional: 445, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23923, independent: 22411, independent conditional: 30, independent unconditional: 22381, dependent: 1512, dependent conditional: 985, dependent unconditional: 527, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23923, independent: 22411, independent conditional: 30, independent unconditional: 22381, dependent: 1512, dependent conditional: 125, dependent unconditional: 1387, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23923, independent: 22411, independent conditional: 30, independent unconditional: 22381, dependent: 1512, dependent conditional: 125, dependent unconditional: 1387, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4734, independent: 4674, independent conditional: 4, independent unconditional: 4670, dependent: 60, dependent conditional: 8, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4734, independent: 4637, independent conditional: 0, independent unconditional: 4637, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 97, independent: 37, independent conditional: 4, independent unconditional: 33, dependent: 60, dependent conditional: 8, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 37, independent conditional: 4, independent unconditional: 33, dependent: 60, dependent conditional: 8, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 156, independent: 57, independent conditional: 3, independent unconditional: 54, dependent: 99, dependent conditional: 9, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 23923, independent: 17737, independent conditional: 26, independent unconditional: 17711, dependent: 1452, dependent conditional: 117, dependent unconditional: 1335, unknown: 4734, unknown conditional: 12, unknown unconditional: 4722] , Statistics on independence cache: Total cache size (in pairs): 4734, Positive cache size: 4674, Positive conditional cache size: 4, Positive unconditional cache size: 4670, Negative cache size: 60, Negative conditional cache size: 8, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 860, Maximal queried relation: 5, Independence queries for same thread: 1047 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 1068, Number of trivial persistent sets: 1062, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5732, independent: 5680, independent conditional: 0, independent unconditional: 5680, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 23955, independent: 22411, independent conditional: 16731, independent unconditional: 5680, dependent: 1544, dependent conditional: 1492, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22908, independent: 22411, independent conditional: 16731, independent unconditional: 5680, dependent: 497, dependent conditional: 445, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22908, independent: 22411, independent conditional: 16731, independent unconditional: 5680, dependent: 497, dependent conditional: 445, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23923, independent: 22411, independent conditional: 30, independent unconditional: 22381, dependent: 1512, dependent conditional: 985, dependent unconditional: 527, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23923, independent: 22411, independent conditional: 30, independent unconditional: 22381, dependent: 1512, dependent conditional: 125, dependent unconditional: 1387, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23923, independent: 22411, independent conditional: 30, independent unconditional: 22381, dependent: 1512, dependent conditional: 125, dependent unconditional: 1387, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4734, independent: 4674, independent conditional: 4, independent unconditional: 4670, dependent: 60, dependent conditional: 8, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4734, independent: 4637, independent conditional: 0, independent unconditional: 4637, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 97, independent: 37, independent conditional: 4, independent unconditional: 33, dependent: 60, dependent conditional: 8, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 37, independent conditional: 4, independent unconditional: 33, dependent: 60, dependent conditional: 8, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 156, independent: 57, independent conditional: 3, independent unconditional: 54, dependent: 99, dependent conditional: 9, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 23923, independent: 17737, independent conditional: 26, independent unconditional: 17711, dependent: 1452, dependent conditional: 117, dependent unconditional: 1335, unknown: 4734, unknown conditional: 12, unknown unconditional: 4722] , Statistics on independence cache: Total cache size (in pairs): 4734, Positive cache size: 4674, Positive conditional cache size: 4, Positive unconditional cache size: 4670, Negative cache size: 60, Negative conditional cache size: 8, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 860, Maximal queried relation: 5, Independence queries for same thread: 1047 - CounterExampleResult [Line: 121]: assertion can be violated assertion can be violated We found a FailurePath: [L115] 0 assume x_0 == x_8 && y_1 == y_9; VAL [x_0=-3, x_8=-3, y_1=-3, y_9=-3] [L116] FORK 0 fork 1 thread1(); VAL [x_0=-3, x_8=-3, y_1=-3, y_9=-3] [L117] FORK 0 fork 4, 4, 4, 4 thread4(); VAL [x_0=-3, x_8=-3, y_1=-3, y_9=-3] [L60] 1 f1_2 := false; [L61] 1 f2_3 := false; VAL [f1_2=false, f2_3=false, x_0=-3, x_8=-3, y_1=-3, y_9=-3] [L63] FORK 1 fork 2, 2 thread2(); VAL [f1_2=false, f2_3=false, x_0=-3, x_8=-3, y_1=-3, y_9=-3] [L30] 3 temp_4 := x_0; VAL [f1_2=false, f2_3=false, temp_4=-3, x_0=-3, x_8=-3, y_1=-3, y_9=-3] [L31] 3 x_0 := temp_4 + 1; VAL [f1_2=false, f2_3=false, temp_4=-3, x_0=-2, x_8=-3, y_1=-3, y_9=-3] [L32] 3 f1_2 := true; VAL [f1_2=true, f2_3=false, temp_4=-3, x_0=-2, x_8=-3, y_1=-3, y_9=-3] [L103] 2 f1_10 := false; [L104] 2 f2_11 := false; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-3, x_0=-2, x_8=-3, y_1=-3, y_9=-3] [L106] FORK 2 fork 5, 5, 5, 5, 5 thread5(); VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_4=-3, x_0=-2, x_8=-3, y_1=-3, y_9=-3] [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=-3, y_9=-3] [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=-3, y_9=-3] [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=-3, y_9=-3] [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=-3, y_9=-3] [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=-3, x_0=-2, x_8=-2, y_1=-3, y_9=-3] [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=-3, x_0=-2, x_8=-2, y_1=-2, y_9=-3] [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=-3, x_0=-2, x_8=-2, y_1=-2, y_9=-3] [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=-3, x_0=-2, x_8=-2, y_1=-2, y_9=-3] [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=-2, temp_6=-3, x_0=-2, x_8=-2, y_1=-2, y_9=-3] [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=-2, temp_6=-3, x_0=-2, x_8=-2, y_1=-1, y_9=-3] [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=-2, temp_6=-3, x_0=-2, x_8=-2, y_1=-1, y_9=-3] [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=-2, temp_6=-3, x_0=-2, x_8=-2, y_1=-1, y_9=-3] [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=-2, temp_6=-3, temp_7=-2, x_0=-2, x_8=-2, y_1=-1, y_9=-3] [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=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-3] [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=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-3] [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=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-3] [L52] 5 assume !f1_2; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-3] [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=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-3] [L88] 6 temp_14 := y_9; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-3] [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=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-2] [L90] 6 f2_11 := true; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-2] [L76] 4 assume f2_11; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-2] [L77] 4 temp_13 := y_9; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-2] [L78] 4 y_9 := temp_13 + 1; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-1] [L91] 6 assume f1_10; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-1] [L79] 4 f1_10 := false; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-1] [L92] 6 temp_15 := x_8; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-2, y_1=-1, y_9=-1] [L93] 6 x_8 := temp_15 + 1; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L94] 6 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L80] 4 assume !f2_11; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L95] 6 assume !f1_10; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L65] JOIN 3 join 2, 2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, 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=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L118] JOIN 1 join 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-3, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L73] 4 temp_12 := x_8; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L74] 4 x_8 := temp_12 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L75] 4 f1_10 := true; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=-2, temp_14=-3, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L88] 6 temp_14 := y_9; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=-2, temp_14=-1, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L89] 6 y_9 := temp_14 + 1; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=-2, temp_14=-1, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=0] [L90] 6 f2_11 := true; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=-2, temp_14=-1, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=0] [L76] 4 assume f2_11; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=-2, temp_14=-1, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=0] [L77] 4 temp_13 := y_9; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, 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=-1, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=1] [L91] 6 assume f1_10; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=1] [L79] 4 f1_10 := false; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=-2, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=1] [L92] 6 temp_15 := x_8; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=0, y_1=-1, y_9=1] [L93] 6 x_8 := temp_15 + 1; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, y_9=1] [L94] 6 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, y_9=1] [L80] 4 assume !f2_11; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, y_9=1] [L95] 6 assume !f1_10; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, 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=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, y_9=1] [L109] JOIN 6 join 6, 6, 6, 6, 6, 6; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, y_9=1] [L119] JOIN 2 join 4, 4, 4, 4; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, y_9=1] [L120] 0 assume !(x_0 == x_8 && y_1 == y_9); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, y_9=1] [L121] 0 assert false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=1, y_1=-1, 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.8s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, 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.5s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 1.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 41, 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, 535 NumberOfCodeBlocks, 535 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 510 ConstructedInterpolants, 0 QuantifiedInterpolants, 2349 SizeOfPredicates, 16 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 57/63 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! [2023-05-19 20:15:51,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2023-05-19 20:15:51,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-05-19 20:15:51,554 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...