/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 '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por GLOBAL_READ_WRITE -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-218013a [2023-05-03 17:54:29,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-03 17:54:29,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-03 17:54:29,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-03 17:54:29,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-03 17:54:29,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-03 17:54:29,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-03 17:54:29,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-03 17:54:29,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-03 17:54:29,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-03 17:54:29,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-03 17:54:29,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-03 17:54:29,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-03 17:54:29,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-03 17:54:29,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-03 17:54:29,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-03 17:54:29,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-03 17:54:29,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-03 17:54:29,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-03 17:54:29,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-03 17:54:29,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-03 17:54:29,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-03 17:54:29,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-03 17:54:29,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-03 17:54:29,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-03 17:54:29,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-03 17:54:29,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-03 17:54:29,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-03 17:54:29,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-03 17:54:29,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-03 17:54:29,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-03 17:54:29,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-03 17:54:29,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-03 17:54:29,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-03 17:54:29,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-03 17:54:29,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-03 17:54:29,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-03 17:54:29,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-03 17:54:29,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-03 17:54:29,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-03 17:54:29,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-03 17:54:29,341 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-03 17:54:29,362 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-03 17:54:29,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-03 17:54:29,363 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-03 17:54:29,363 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-03 17:54:29,363 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-03 17:54:29,363 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-03 17:54:29,364 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-03 17:54:29,364 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-03 17:54:29,364 INFO L138 SettingsManager]: * Use SBE=true [2023-05-03 17:54:29,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-03 17:54:29,365 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-03 17:54:29,365 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-03 17:54:29,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-03 17:54:29,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-03 17:54:29,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-03 17:54:29,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-03 17:54:29,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-03 17:54:29,365 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-03 17:54:29,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-03 17:54:29,365 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-03 17:54:29,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-03 17:54:29,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-03 17:54:29,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-03 17:54:29,366 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-03 17:54:29,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-03 17:54:29,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-03 17:54:29,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-03 17:54:29,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-03 17:54:29,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-03 17:54:29,367 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-03 17:54:29,367 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-03 17:54:29,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-03 17:54:29,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-03 17:54:29,367 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-03 17:54:29,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-03 17:54:29,368 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-03 17:54:29,368 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 -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> GLOBAL_READ_WRITE [2023-05-03 17:54:29,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-03 17:54:29,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-03 17:54:29,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-03 17:54:29,572 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-05-03 17:54:29,573 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2023-05-03 17:54:29,574 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-03 17:54:29,574 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-03 17:54:29,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-03 17:54:29,594 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-05-03 17:54:29,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-03 17:54:29,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-03 17:54:29,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-03 17:54:29,603 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 03.05 05:54:29" (1/1) ... [2023-05-03 17:54:29,607 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 03.05 05:54:29" (1/1) ... [2023-05-03 17:54:29,611 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-05-03 17:54:29,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-03 17:54:29,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-03 17:54:29,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-03 17:54:29,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-03 17:54:29,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 05:54:29" (1/1) ... [2023-05-03 17:54:29,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 05:54:29" (1/1) ... [2023-05-03 17:54:29,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 05:54:29" (1/1) ... [2023-05-03 17:54:29,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 05:54:29" (1/1) ... [2023-05-03 17:54:29,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 05:54:29" (1/1) ... [2023-05-03 17:54:29,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 05:54:29" (1/1) ... [2023-05-03 17:54:29,623 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 05:54:29" (1/1) ... [2023-05-03 17:54:29,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 05:54:29" (1/1) ... [2023-05-03 17:54:29,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-03 17:54:29,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-03 17:54:29,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-03 17:54:29,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-03 17:54:29,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 05:54:29" (1/1) ... [2023-05-03 17:54:29,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-03 17:54:29,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-03 17:54:29,642 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-03 17:54:29,666 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-03 17:54:29,688 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-05-03 17:54:29,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-03 17:54:29,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-03 17:54:29,688 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-05-03 17:54:29,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-03 17:54:29,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-03 17:54:29,688 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-05-03 17:54:29,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-03 17:54:29,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-03 17:54:29,688 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-05-03 17:54:29,689 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-05-03 17:54:29,689 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-05-03 17:54:29,689 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-05-03 17:54:29,689 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-05-03 17:54:29,689 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-05-03 17:54:29,689 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2023-05-03 17:54:29,689 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-05-03 17:54:29,689 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-05-03 17:54:29,689 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2023-05-03 17:54:29,689 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-05-03 17:54:29,689 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-05-03 17:54:29,690 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-03 17:54:29,729 INFO L235 CfgBuilder]: Building ICFG [2023-05-03 17:54:29,731 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-03 17:54:29,863 INFO L276 CfgBuilder]: Performing block encoding [2023-05-03 17:54:29,872 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-03 17:54:29,872 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-05-03 17:54:29,873 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 05:54:29 BoogieIcfgContainer [2023-05-03 17:54:29,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-03 17:54:29,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-03 17:54:29,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-03 17:54:29,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-03 17:54:29,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.05 05:54:29" (1/2) ... [2023-05-03 17:54:29,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45515ccb and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 05:54:29, skipping insertion in model container [2023-05-03 17:54:29,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 05:54:29" (2/2) ... [2023-05-03 17:54:29,878 INFO L112 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2023-05-03 17:54:29,883 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-03 17:54:29,888 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-03 17:54:29,888 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-03 17:54:29,889 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-03 17:54:29,965 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-05-03 17:54:29,995 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-03 17:54:29,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-03 17:54:29,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-03 17:54:29,997 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-03 17:54:30,046 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-03 17:54:30,060 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-03 17:54:30,072 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread4Thread1of1ForFork3 ======== [2023-05-03 17:54:30,076 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;@35d83633, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-03 17:54:30,076 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-03 17:54:30,858 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-05-03 17:54:30,859 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-05-03 17:54:30,877 INFO L444 BasicCegarLoop]: Path program histogram: [] [2023-05-03 17:54:30,880 INFO L307 ceAbstractionStarter]: Result for error location thread4Thread1of1ForFork3 was SAFE,SAFE (1/3) [2023-05-03 17:54:30,885 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-03 17:54:30,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-03 17:54:30,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-03 17:54:30,898 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-03 17:54:30,903 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-03 17:54:30,904 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-03 17:54:30,904 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;@35d83633, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-03 17:54:30,904 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-03 17:54:30,920 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-03 17:54:31,065 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-03 17:54:31,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-03 17:54:31,069 INFO L85 PathProgramCache]: Analyzing trace with hash -776914005, now seen corresponding path program 1 times [2023-05-03 17:54:31,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-03 17:54:31,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134611949] [2023-05-03 17:54:31,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-03 17:54:31,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-03 17:54:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-03 17:54:31,301 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-05-03 17:54:31,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-03 17:54:31,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134611949] [2023-05-03 17:54:31,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134611949] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-03 17:54:31,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-03 17:54:31,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-03 17:54:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049134164] [2023-05-03 17:54:31,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-03 17:54:31,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-03 17:54:31,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-03 17:54:31,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-03 17:54:31,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-03 17:54:31,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-03 17:54:31,328 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-03 17:54:31,328 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-03 17:54:31,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-03 17:54:31,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 17:54:31,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-03 17:54:31,395 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-03 17:54:31,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-03 17:54:31,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1452871402, now seen corresponding path program 1 times [2023-05-03 17:54:31,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-03 17:54:31,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626612992] [2023-05-03 17:54:31,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-03 17:54:31,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-03 17:54:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-03 17:54:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-05-03 17:54:31,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-03 17:54:31,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626612992] [2023-05-03 17:54:31,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626612992] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-03 17:54:31,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-03 17:54:31,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-03 17:54:31,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000990418] [2023-05-03 17:54:31,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-03 17:54:31,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-03 17:54:31,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-03 17:54:31,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-03 17:54:31,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-03 17:54:31,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-03 17:54:31,497 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-03 17:54:31,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-03 17:54:31,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 17:54:31,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-03 17:54:31,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 17:54:31,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 17:54:31,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-03 17:54:31,564 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-03 17:54:31,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-03 17:54:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash -948056087, now seen corresponding path program 2 times [2023-05-03 17:54:31,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-03 17:54:31,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464496813] [2023-05-03 17:54:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-03 17:54:31,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-03 17:54:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-03 17:54:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-05-03 17:54:31,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-03 17:54:31,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464496813] [2023-05-03 17:54:31,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464496813] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-03 17:54:31,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-03 17:54:31,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-03 17:54:31,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062918115] [2023-05-03 17:54:31,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-03 17:54:31,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-03 17:54:31,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-03 17:54:31,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-03 17:54:31,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-03 17:54:31,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-03 17:54:31,645 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-03 17:54:31,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-03 17:54:31,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 17:54:31,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 17:54:31,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-03 17:54:31,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 17:54:31,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 17:54:31,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 17:54:31,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-03 17:54:31,825 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-03 17:54:31,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-03 17:54:31,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1710977285, now seen corresponding path program 1 times [2023-05-03 17:54:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-03 17:54:31,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460305970] [2023-05-03 17:54:31,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-03 17:54:31,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-03 17:54:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-03 17:54:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-05-03 17:54:31,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-03 17:54:31,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460305970] [2023-05-03 17:54:31,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460305970] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-03 17:54:31,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-03 17:54:31,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-03 17:54:31,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5544888] [2023-05-03 17:54:31,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-03 17:54:31,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-03 17:54:31,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-03 17:54:31,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-03 17:54:31,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-03 17:54:31,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-03 17:54:31,892 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-03 17:54:31,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-03 17:54:31,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 17:54:31,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 17:54:31,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-03 17:54:31,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-03 17:54:31,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 17:54:31,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 17:54:31,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 17:54:31,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-03 17:54:31,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-03 17:54:31,959 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-03 17:54:31,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-03 17:54:31,959 INFO L85 PathProgramCache]: Analyzing trace with hash -953412687, now seen corresponding path program 2 times [2023-05-03 17:54:31,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-03 17:54:31,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184434632] [2023-05-03 17:54:31,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-03 17:54:31,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-03 17:54:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-03 17:54:31,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-03 17:54:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-03 17:54:32,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-03 17:54:32,035 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-03 17:54:32,035 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2023-05-03 17:54:32,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-03 17:54:32,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-03 17:54:32,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-03 17:54:32,039 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2023-05-03 17:54:32,039 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/3) [2023-05-03 17:54:32,042 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-03 17:54:32,042 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-03 17:54:32,085 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 05:54:32 BasicIcfg [2023-05-03 17:54:32,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-03 17:54:32,086 INFO L158 Benchmark]: Toolchain (without parser) took 2491.46ms. Allocated memory was 255.9MB in the beginning and 413.1MB in the end (delta: 157.3MB). Free memory was 209.6MB in the beginning and 181.5MB in the end (delta: 28.1MB). Peak memory consumption was 183.8MB. Max. memory is 8.0GB. [2023-05-03 17:54:32,086 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 255.9MB. Free memory is still 210.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-03 17:54:32,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.62ms. Allocated memory is still 255.9MB. Free memory was 209.5MB in the beginning and 208.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-03 17:54:32,087 INFO L158 Benchmark]: Boogie Preprocessor took 11.37ms. Allocated memory is still 255.9MB. Free memory was 207.9MB in the beginning and 206.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-03 17:54:32,087 INFO L158 Benchmark]: RCFGBuilder took 248.63ms. Allocated memory is still 255.9MB. Free memory was 206.7MB in the beginning and 226.9MB in the end (delta: -20.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-05-03 17:54:32,087 INFO L158 Benchmark]: TraceAbstraction took 2210.99ms. Allocated memory was 255.9MB in the beginning and 413.1MB in the end (delta: 157.3MB). Free memory was 225.5MB in the beginning and 181.5MB in the end (delta: 44.0MB). Peak memory consumption was 199.5MB. Max. memory is 8.0GB. [2023-05-03 17:54:32,088 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.09ms. Allocated memory is still 255.9MB. Free memory is still 210.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 16.62ms. Allocated memory is still 255.9MB. Free memory was 209.5MB in the beginning and 208.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.37ms. Allocated memory is still 255.9MB. Free memory was 207.9MB in the beginning and 206.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 248.63ms. Allocated memory is still 255.9MB. Free memory was 206.7MB in the beginning and 226.9MB in the end (delta: -20.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2210.99ms. Allocated memory was 255.9MB in the beginning and 413.1MB in the end (delta: 157.3MB). Free memory was 225.5MB in the beginning and 181.5MB in the end (delta: 44.0MB). Peak memory consumption was 199.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 17432, independent: 15317, independent conditional: 10970, independent unconditional: 4347, dependent: 2115, dependent conditional: 2076, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15713, independent: 15317, independent conditional: 10970, independent unconditional: 4347, dependent: 396, dependent conditional: 357, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15713, independent: 15317, independent conditional: 10970, independent unconditional: 4347, dependent: 396, dependent conditional: 357, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15713, independent: 15317, independent conditional: 0, independent unconditional: 15317, dependent: 396, dependent conditional: 0, dependent unconditional: 396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15713, independent: 15317, independent conditional: 0, independent unconditional: 15317, dependent: 396, dependent conditional: 0, dependent unconditional: 396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15713, independent: 15317, independent conditional: 0, independent unconditional: 15317, dependent: 396, dependent conditional: 0, dependent unconditional: 396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3691, independent: 3652, independent conditional: 0, independent unconditional: 3652, 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: 3691, independent: 3625, independent conditional: 0, independent unconditional: 3625, 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: 221, independent: 92, independent conditional: 0, independent unconditional: 92, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 15713, independent: 11665, independent conditional: 0, independent unconditional: 11665, dependent: 357, dependent conditional: 0, dependent unconditional: 357, unknown: 3691, unknown conditional: 0, unknown unconditional: 3691] , Statistics on independence cache: Total cache size (in pairs): 3691, Positive cache size: 3652, Positive conditional cache size: 0, Positive unconditional cache size: 3652, 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: 1719 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.5s, Number of persistent set computation: 2080, Number of trivial persistent sets: 1016, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4386, independent: 4347, independent conditional: 0, independent unconditional: 4347, 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: 17432, independent: 15317, independent conditional: 10970, independent unconditional: 4347, dependent: 2115, dependent conditional: 2076, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15713, independent: 15317, independent conditional: 10970, independent unconditional: 4347, dependent: 396, dependent conditional: 357, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15713, independent: 15317, independent conditional: 10970, independent unconditional: 4347, dependent: 396, dependent conditional: 357, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15713, independent: 15317, independent conditional: 0, independent unconditional: 15317, dependent: 396, dependent conditional: 0, dependent unconditional: 396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15713, independent: 15317, independent conditional: 0, independent unconditional: 15317, dependent: 396, dependent conditional: 0, dependent unconditional: 396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15713, independent: 15317, independent conditional: 0, independent unconditional: 15317, dependent: 396, dependent conditional: 0, dependent unconditional: 396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3691, independent: 3652, independent conditional: 0, independent unconditional: 3652, 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: 3691, independent: 3625, independent conditional: 0, independent unconditional: 3625, 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: 221, independent: 92, independent conditional: 0, independent unconditional: 92, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 15713, independent: 11665, independent conditional: 0, independent unconditional: 11665, dependent: 357, dependent conditional: 0, dependent unconditional: 357, unknown: 3691, unknown conditional: 0, unknown unconditional: 3691] , Statistics on independence cache: Total cache size (in pairs): 3691, Positive cache size: 3652, Positive conditional cache size: 0, Positive unconditional cache size: 3652, 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: 1719 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18153, independent: 15117, independent conditional: 9780, independent unconditional: 5337, dependent: 3036, dependent conditional: 2988, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15486, independent: 15117, independent conditional: 9780, independent unconditional: 5337, dependent: 369, dependent conditional: 321, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15486, independent: 15117, independent conditional: 9780, independent unconditional: 5337, dependent: 369, dependent conditional: 321, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16324, independent: 15117, independent conditional: 30, independent unconditional: 15087, dependent: 1207, dependent conditional: 808, dependent unconditional: 399, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16324, independent: 15117, independent conditional: 30, independent unconditional: 15087, dependent: 1207, dependent conditional: 96, dependent unconditional: 1111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16324, independent: 15117, independent conditional: 30, independent unconditional: 15087, dependent: 1207, dependent conditional: 96, dependent unconditional: 1111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4390, independent: 4337, independent conditional: 2, independent unconditional: 4335, dependent: 53, dependent conditional: 5, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4390, independent: 4302, independent conditional: 0, independent unconditional: 4302, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 88, independent: 35, independent conditional: 2, independent unconditional: 33, dependent: 53, dependent conditional: 5, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 88, independent: 35, independent conditional: 2, independent unconditional: 33, dependent: 53, dependent conditional: 5, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 141, independent: 46, independent conditional: 1, independent unconditional: 45, dependent: 95, dependent conditional: 9, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 16324, independent: 10780, independent conditional: 28, independent unconditional: 10752, dependent: 1154, dependent conditional: 91, dependent unconditional: 1063, unknown: 4390, unknown conditional: 7, unknown unconditional: 4383] , Statistics on independence cache: Total cache size (in pairs): 4390, Positive cache size: 4337, Positive conditional cache size: 2, Positive unconditional cache size: 4335, Negative cache size: 53, Negative conditional cache size: 5, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 712, Maximal queried relation: 4, Independence queries for same thread: 2667 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 1287, Number of trivial persistent sets: 1270, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5385, independent: 5337, independent conditional: 0, independent unconditional: 5337, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18153, independent: 15117, independent conditional: 9780, independent unconditional: 5337, dependent: 3036, dependent conditional: 2988, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15486, independent: 15117, independent conditional: 9780, independent unconditional: 5337, dependent: 369, dependent conditional: 321, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15486, independent: 15117, independent conditional: 9780, independent unconditional: 5337, dependent: 369, dependent conditional: 321, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16324, independent: 15117, independent conditional: 30, independent unconditional: 15087, dependent: 1207, dependent conditional: 808, dependent unconditional: 399, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16324, independent: 15117, independent conditional: 30, independent unconditional: 15087, dependent: 1207, dependent conditional: 96, dependent unconditional: 1111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16324, independent: 15117, independent conditional: 30, independent unconditional: 15087, dependent: 1207, dependent conditional: 96, dependent unconditional: 1111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4390, independent: 4337, independent conditional: 2, independent unconditional: 4335, dependent: 53, dependent conditional: 5, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4390, independent: 4302, independent conditional: 0, independent unconditional: 4302, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 88, independent: 35, independent conditional: 2, independent unconditional: 33, dependent: 53, dependent conditional: 5, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 88, independent: 35, independent conditional: 2, independent unconditional: 33, dependent: 53, dependent conditional: 5, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 141, independent: 46, independent conditional: 1, independent unconditional: 45, dependent: 95, dependent conditional: 9, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 16324, independent: 10780, independent conditional: 28, independent unconditional: 10752, dependent: 1154, dependent conditional: 91, dependent unconditional: 1063, unknown: 4390, unknown conditional: 7, unknown unconditional: 4383] , Statistics on independence cache: Total cache size (in pairs): 4390, Positive cache size: 4337, Positive conditional cache size: 2, Positive unconditional cache size: 4335, Negative cache size: 53, Negative conditional cache size: 5, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 712, Maximal queried relation: 4, Independence queries for same thread: 2667 - 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=-5, x_8=-5, y_1=-5, y_9=-5] [L116] FORK 0 fork 1 thread1(); VAL [x_0=-5, x_8=-5, y_1=-5, y_9=-5] [L60] 1 f1_2 := false; [L61] 1 f2_3 := false; VAL [f1_2=false, f2_3=false, x_0=-5, x_8=-5, y_1=-5, y_9=-5] [L117] FORK 0 fork 4, 4, 4, 4 thread4(); VAL [f1_2=false, f2_3=false, x_0=-5, x_8=-5, y_1=-5, y_9=-5] [L103] 2 f1_10 := false; [L104] 2 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-5, x_8=-5, y_1=-5, y_9=-5] [L63] FORK 1 fork 2, 2 thread2(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-5, x_8=-5, y_1=-5, y_9=-5] [L30] 3 temp_4 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-5, x_0=-5, x_8=-5, y_1=-5, y_9=-5] [L31] 3 x_0 := temp_4 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-5, x_0=-4, x_8=-5, y_1=-5, y_9=-5] [L106] FORK 2 fork 5, 5, 5, 5, 5 thread5(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_4=-5, x_0=-4, x_8=-5, y_1=-5, y_9=-5] [L73] 4 temp_12 := x_8; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_4=-5, x_0=-4, x_8=-5, y_1=-5, y_9=-5] [L64] FORK 1 fork 3, 3, 3 thread3(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_4=-5, x_0=-4, x_8=-5, y_1=-5, y_9=-5] [L32] 3 f1_2 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_4=-5, x_0=-4, x_8=-5, y_1=-5, y_9=-5] [L107] FORK 2 fork 6, 6, 6, 6, 6, 6 thread6(); VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_4=-5, x_0=-4, x_8=-5, y_1=-5, y_9=-5] [L74] 4 x_8 := temp_12 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_4=-5, x_0=-4, x_8=-4, y_1=-5, y_9=-5] [L88] 6 temp_14 := y_9; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_14=-5, temp_4=-5, x_0=-4, x_8=-4, y_1=-5, y_9=-5] [L45] 5 temp_6 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_14=-5, temp_4=-5, temp_6=-5, x_0=-4, x_8=-4, y_1=-5, y_9=-5] [L46] 5 y_1 := temp_6 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_14=-5, temp_4=-5, temp_6=-5, x_0=-4, x_8=-4, y_1=-4, y_9=-5] [L75] 4 f1_10 := true; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_14=-5, temp_4=-5, temp_6=-5, x_0=-4, x_8=-4, y_1=-4, y_9=-5] [L89] 6 y_9 := temp_14 + 1; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_14=-5, temp_4=-5, temp_6=-5, x_0=-4, x_8=-4, y_1=-4, y_9=-4] [L47] 5 f2_3 := true; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_14=-5, temp_4=-5, temp_6=-5, x_0=-4, x_8=-4, y_1=-4, y_9=-4] [L48] 5 assume f1_2; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_14=-5, temp_4=-5, temp_6=-5, x_0=-4, x_8=-4, y_1=-4, y_9=-4] [L33] 3 assume f2_3; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_14=-5, temp_4=-5, temp_6=-5, x_0=-4, x_8=-4, y_1=-4, y_9=-4] [L34] 3 temp_5 := y_1; VAL [f1_10=true, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_14=-5, temp_4=-5, temp_5=-4, temp_6=-5, x_0=-4, x_8=-4, y_1=-4, y_9=-4] [L90] 6 f2_11 := true; VAL [f1_10=true, f1_2=true, f2_11=true, f2_3=true, temp_12=-5, temp_14=-5, temp_4=-5, temp_5=-4, temp_6=-5, x_0=-4, x_8=-4, y_1=-4, y_9=-4] [L49] 5 temp_7 := x_0; VAL [f1_10=true, f1_2=true, f2_11=true, f2_3=true, temp_12=-5, temp_14=-5, temp_4=-5, temp_5=-4, temp_6=-5, temp_7=-4, x_0=-4, x_8=-4, y_1=-4, y_9=-4] [L50] 5 x_0 := temp_7 + 1; VAL [f1_10=true, f1_2=true, f2_11=true, f2_3=true, temp_12=-5, temp_14=-5, temp_4=-5, temp_5=-4, temp_6=-5, temp_7=-4, x_0=-3, x_8=-4, y_1=-4, y_9=-4] [L35] 3 y_1 := temp_5 + 1; VAL [f1_10=true, f1_2=true, f2_11=true, f2_3=true, temp_12=-5, temp_14=-5, temp_4=-5, temp_5=-4, temp_6=-5, temp_7=-4, x_0=-3, x_8=-4, y_1=-3, y_9=-4] [L36] 3 f1_2 := false; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=true, temp_12=-5, temp_14=-5, temp_4=-5, temp_5=-4, temp_6=-5, temp_7=-4, x_0=-3, x_8=-4, y_1=-3, y_9=-4] [L76] 4 assume f2_11; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=true, temp_12=-5, temp_14=-5, temp_4=-5, temp_5=-4, temp_6=-5, temp_7=-4, x_0=-3, x_8=-4, y_1=-3, y_9=-4] [L91] 6 assume f1_10; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=true, temp_12=-5, temp_14=-5, temp_4=-5, temp_5=-4, temp_6=-5, temp_7=-4, x_0=-3, x_8=-4, y_1=-3, y_9=-4] [L51] 5 f2_3 := false; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-5, temp_14=-5, temp_4=-5, temp_5=-4, temp_6=-5, temp_7=-4, x_0=-3, x_8=-4, y_1=-3, y_9=-4] [L52] 5 assume !f1_2; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-5, temp_14=-5, temp_4=-5, temp_5=-4, temp_6=-5, temp_7=-4, x_0=-3, x_8=-4, y_1=-3, y_9=-4] [L37] 3 assume !f2_3; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-5, temp_14=-5, temp_4=-5, temp_5=-4, temp_6=-5, temp_7=-4, x_0=-3, x_8=-4, y_1=-3, y_9=-4] [L30] 3 temp_4 := x_0; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-5, temp_14=-5, temp_4=-3, temp_5=-4, temp_6=-5, temp_7=-4, x_0=-3, x_8=-4, y_1=-3, y_9=-4] [L77] 4 temp_13 := y_9; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_4=-3, temp_5=-4, temp_6=-5, temp_7=-4, x_0=-3, x_8=-4, y_1=-3, y_9=-4] [L92] 6 temp_15 := x_8; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-4, temp_6=-5, temp_7=-4, x_0=-3, x_8=-4, y_1=-3, y_9=-4] [L45] 5 temp_6 := y_1; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-3, x_8=-4, y_1=-3, y_9=-4] [L46] 5 y_1 := temp_6 + 1; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-3, x_8=-4, y_1=-2, y_9=-4] [L31] 3 x_0 := temp_4 + 1; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-2, x_8=-4, y_1=-2, y_9=-4] [L32] 3 f1_2 := true; VAL [f1_10=true, f1_2=true, f2_11=true, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-2, x_8=-4, y_1=-2, y_9=-4] [L78] 4 y_9 := temp_13 + 1; VAL [f1_10=true, f1_2=true, f2_11=true, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-2, x_8=-4, y_1=-2, y_9=-3] [L93] 6 x_8 := temp_15 + 1; VAL [f1_10=true, f1_2=true, f2_11=true, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-2, x_8=-3, y_1=-2, y_9=-3] [L47] 5 f2_3 := true; VAL [f1_10=true, f1_2=true, f2_11=true, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-2, x_8=-3, y_1=-2, y_9=-3] [L48] 5 assume f1_2; VAL [f1_10=true, f1_2=true, f2_11=true, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-2, x_8=-3, y_1=-2, y_9=-3] [L33] 3 assume f2_3; VAL [f1_10=true, f1_2=true, f2_11=true, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-4, temp_6=-3, temp_7=-4, x_0=-2, x_8=-3, y_1=-2, y_9=-3] [L34] 3 temp_5 := y_1; VAL [f1_10=true, f1_2=true, f2_11=true, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-4, x_0=-2, x_8=-3, y_1=-2, y_9=-3] [L79] 4 f1_10 := false; VAL [f1_10=false, f1_2=true, f2_11=true, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-4, x_0=-2, x_8=-3, y_1=-2, y_9=-3] [L94] 6 f2_11 := false; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-4, x_0=-2, x_8=-3, y_1=-2, y_9=-3] [L49] 5 temp_7 := x_0; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-2, x_8=-3, y_1=-2, y_9=-3] [L50] 5 x_0 := temp_7 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-3, y_1=-2, y_9=-3] [L35] 3 y_1 := temp_5 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-3, y_1=-1, y_9=-3] [L36] 3 f1_2 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-3, y_1=-1, y_9=-3] [L80] 4 assume !f2_11; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-3, y_1=-1, y_9=-3] [L95] 6 assume !f1_10; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-3, y_1=-1, y_9=-3] [L51] 5 f2_3 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-3, y_1=-1, y_9=-3] [L52] 5 assume !f1_2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-3, y_1=-1, y_9=-3] [L37] 3 assume !f2_3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-3, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-3, y_1=-1, y_9=-3] [L30] 3 temp_4 := x_0; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-3, y_1=-1, y_9=-3] [L108] JOIN 4 join 5, 5, 5, 5, 5; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-3, y_1=-1, y_9=-3] [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=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-3, temp_7=-2, x_0=-1, x_8=-3, y_1=-1, y_9=-3] [L45] 5 temp_6 := y_1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, x_0=-1, x_8=-3, y_1=-1, y_9=-3] [L46] 5 y_1 := temp_6 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, x_0=-1, x_8=-3, y_1=0, y_9=-3] [L31] 3 x_0 := temp_4 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, x_0=0, x_8=-3, y_1=0, y_9=-3] [L32] 3 f1_2 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, x_0=0, x_8=-3, y_1=0, y_9=-3] [L47] 5 f2_3 := true; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, x_0=0, x_8=-3, y_1=0, y_9=-3] [L48] 5 assume f1_2; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, x_0=0, x_8=-3, y_1=0, y_9=-3] [L33] 3 assume f2_3; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=-2, temp_6=-1, temp_7=-2, x_0=0, x_8=-3, y_1=0, y_9=-3] [L34] 3 temp_5 := y_1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=-2, x_0=0, x_8=-3, y_1=0, y_9=-3] [L49] 5 temp_7 := x_0; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=0, x_8=-3, y_1=0, y_9=-3] [L50] 5 x_0 := temp_7 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=0, y_9=-3] [L35] 3 y_1 := temp_5 + 1; VAL [f1_10=false, f1_2=true, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [L36] 3 f1_2 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=true, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [L51] 5 f2_3 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [L52] 5 assume !f1_2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [L37] 3 assume !f2_3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [L65] JOIN 3 join 2, 2; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [L66] JOIN 5 join 3, 3, 3; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [L118] JOIN 1 join 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [L119] JOIN 2 join 4, 4, 4, 4; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [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=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] [L121] 0 assert false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-5, temp_13=-4, temp_14=-5, temp_15=-4, temp_4=-1, temp_5=0, temp_6=-1, temp_7=0, x_0=1, x_8=-3, y_1=1, y_9=-3] - 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: 1.1s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.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: 12, 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, 0.3s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 416 ConstructedInterpolants, 0 QuantifiedInterpolants, 482 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 505/505 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-03 17:54:32,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2023-05-03 17:54:32,334 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-03 17:54:32,534 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...