./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix044.opt.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044.opt.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-19 01:43:42,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 01:43:42,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 01:43:42,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 01:43:42,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 01:43:42,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 01:43:42,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 01:43:42,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 01:43:42,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 01:43:42,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 01:43:42,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 01:43:42,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 01:43:42,767 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 01:43:42,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 01:43:42,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 01:43:42,769 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 01:43:42,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 01:43:42,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 01:43:42,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 01:43:42,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 01:43:42,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 01:43:42,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 01:43:42,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 01:43:42,772 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 01:43:42,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 01:43:42,773 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 01:43:42,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 01:43:42,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 01:43:42,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 01:43:42,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 01:43:42,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 01:43:42,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 01:43:42,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 01:43:42,774 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 01:43:42,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 01:43:42,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 01:43:42,775 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 01:43:42,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 01:43:42,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 01:43:42,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 01:43:42,775 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 01:43:42,777 INFO L153 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/UGemCutter-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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-19 01:43:42,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 01:43:43,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 01:43:43,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 01:43:43,003 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 01:43:43,003 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 01:43:43,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2024-10-19 01:43:44,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 01:43:44,520 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 01:43:44,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2024-10-19 01:43:44,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f21e10d18/50f7c7b6dd7a454ea3dc4967b529a4a0/FLAG0651251a9 [2024-10-19 01:43:44,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f21e10d18/50f7c7b6dd7a454ea3dc4967b529a4a0 [2024-10-19 01:43:44,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 01:43:44,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 01:43:44,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 01:43:44,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 01:43:44,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 01:43:44,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 01:43:44" (1/1) ... [2024-10-19 01:43:44,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bda453e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:43:44, skipping insertion in model container [2024-10-19 01:43:44,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 01:43:44" (1/1) ... [2024-10-19 01:43:44,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 01:43:44,741 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044.opt.i[944,957] [2024-10-19 01:43:44,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 01:43:44,969 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 01:43:44,979 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044.opt.i[944,957] [2024-10-19 01:43:45,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 01:43:45,066 INFO L204 MainTranslator]: Completed translation [2024-10-19 01:43:45,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:43:45 WrapperNode [2024-10-19 01:43:45,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 01:43:45,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 01:43:45,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 01:43:45,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 01:43:45,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:43:45" (1/1) ... [2024-10-19 01:43:45,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:43:45" (1/1) ... [2024-10-19 01:43:45,127 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2024-10-19 01:43:45,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 01:43:45,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 01:43:45,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 01:43:45,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 01:43:45,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:43:45" (1/1) ... [2024-10-19 01:43:45,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:43:45" (1/1) ... [2024-10-19 01:43:45,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:43:45" (1/1) ... [2024-10-19 01:43:45,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:43:45" (1/1) ... [2024-10-19 01:43:45,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:43:45" (1/1) ... [2024-10-19 01:43:45,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:43:45" (1/1) ... [2024-10-19 01:43:45,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:43:45" (1/1) ... [2024-10-19 01:43:45,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:43:45" (1/1) ... [2024-10-19 01:43:45,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 01:43:45,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 01:43:45,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 01:43:45,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 01:43:45,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:43:45" (1/1) ... [2024-10-19 01:43:45,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 01:43:45,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 01:43:45,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-19 01:43:45,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-19 01:43:45,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-19 01:43:45,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 01:43:45,254 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-19 01:43:45,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-19 01:43:45,255 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-19 01:43:45,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-19 01:43:45,255 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-19 01:43:45,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-19 01:43:45,255 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-19 01:43:45,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-19 01:43:45,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 01:43:45,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-19 01:43:45,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 01:43:45,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 01:43:45,258 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 01:43:45,378 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 01:43:45,380 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 01:43:45,604 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 01:43:45,604 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 01:43:45,723 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 01:43:45,723 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-19 01:43:45,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 01:43:45 BoogieIcfgContainer [2024-10-19 01:43:45,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 01:43:45,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 01:43:45,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 01:43:45,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 01:43:45,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 01:43:44" (1/3) ... [2024-10-19 01:43:45,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776863e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 01:43:45, skipping insertion in model container [2024-10-19 01:43:45,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 01:43:45" (2/3) ... [2024-10-19 01:43:45,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776863e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 01:43:45, skipping insertion in model container [2024-10-19 01:43:45,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 01:43:45" (3/3) ... [2024-10-19 01:43:45,731 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2024-10-19 01:43:45,746 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 01:43:45,747 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-19 01:43:45,747 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 01:43:45,788 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-19 01:43:45,830 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 01:43:45,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 01:43:45,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 01:43:45,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 01:43:45,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-19 01:43:45,916 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 01:43:45,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:43:45,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 01:43:45,937 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@4ccafc5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 01:43:45,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-19 01:44:01,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 01:44:01,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:44:01,981 INFO L85 PathProgramCache]: Analyzing trace with hash -120260627, now seen corresponding path program 1 times [2024-10-19 01:44:01,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:44:01,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575571116] [2024-10-19 01:44:01,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:01,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:44:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:44:02,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 01:44:02,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575571116] [2024-10-19 01:44:02,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575571116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 01:44:02,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 01:44:02,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 01:44:02,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102278265] [2024-10-19 01:44:02,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 01:44:02,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 01:44:02,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 01:44:02,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 01:44:02,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 01:44:02,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:44:02,887 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 01:44:02,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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) [2024-10-19 01:44:02,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:44:10,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:44:10,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-19 01:44:10,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 01:44:10,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:44:10,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2129042833, now seen corresponding path program 1 times [2024-10-19 01:44:10,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:44:10,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333473653] [2024-10-19 01:44:10,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:10,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:44:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:44:10,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 01:44:10,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333473653] [2024-10-19 01:44:10,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333473653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 01:44:10,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 01:44:10,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-19 01:44:10,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30164814] [2024-10-19 01:44:10,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 01:44:10,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-19 01:44:10,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 01:44:10,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 01:44:10,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-19 01:44:10,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:44:10,572 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 01:44:10,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 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) [2024-10-19 01:44:10,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:44:10,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:44:12,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1131778457, now seen corresponding path program 1 times [2024-10-19 01:44:12,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:12,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:12,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:44:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:12,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:44:12,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 01:44:12,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-10-19 01:44:12,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 01:44:12,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:44:12,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1791867311, now seen corresponding path program 1 times [2024-10-19 01:44:12,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:44:12,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508623011] [2024-10-19 01:44:12,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:12,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:44:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:44:13,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 01:44:13,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508623011] [2024-10-19 01:44:13,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508623011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 01:44:13,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 01:44:13,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-19 01:44:13,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58668724] [2024-10-19 01:44:13,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 01:44:13,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-19 01:44:13,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 01:44:13,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-19 01:44:13,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-19 01:44:13,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:44:13,160 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 01:44:13,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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) [2024-10-19 01:44:13,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:44:13,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-19 01:44:13,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:44:13,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1131778450, now seen corresponding path program 1 times [2024-10-19 01:44:13,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:13,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:13,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:44:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:13,490 INFO L85 PathProgramCache]: Analyzing trace with hash 22838239, now seen corresponding path program 1 times [2024-10-19 01:44:13,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:13,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:13,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:44:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1509469956, now seen corresponding path program 1 times [2024-10-19 01:44:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:13,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:44:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:13,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1059686375, now seen corresponding path program 1 times [2024-10-19 01:44:13,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:13,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:13,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:44:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash 449826352, now seen corresponding path program 1 times [2024-10-19 01:44:13,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:13,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:13,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:44:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:14,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1195971478, now seen corresponding path program 1 times [2024-10-19 01:44:14,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:14,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:14,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:44:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:14,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1067758309, now seen corresponding path program 1 times [2024-10-19 01:44:14,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:14,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:14,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:44:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:14,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1176368422, now seen corresponding path program 1 times [2024-10-19 01:44:14,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:14,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:14,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:44:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:14,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1977609693, now seen corresponding path program 1 times [2024-10-19 01:44:14,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:14,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:14,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:44:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:16,152 INFO L85 PathProgramCache]: Analyzing trace with hash 734143672, now seen corresponding path program 1 times [2024-10-19 01:44:16,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:16,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:44:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:44:16,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:16,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:44:16,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:44:16,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 01:44:16,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 01:44:35,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2027132759, now seen corresponding path program 1 times [2024-10-19 01:44:35,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:35,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:35,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:44:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash -989973251, now seen corresponding path program 1 times [2024-10-19 01:44:36,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:36,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:36,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:44:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:37,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1278679890, now seen corresponding path program 1 times [2024-10-19 01:44:37,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:37,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:37,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:44:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:38,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1841586499, now seen corresponding path program 1 times [2024-10-19 01:44:38,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:38,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:38,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:44:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:48,007 INFO L85 PathProgramCache]: Analyzing trace with hash 2020962656, now seen corresponding path program 1 times [2024-10-19 01:44:48,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:44:48,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:44:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:44:48,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:44:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:45:11,677 INFO L85 PathProgramCache]: Analyzing trace with hash -917814, now seen corresponding path program 1 times [2024-10-19 01:45:11,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:45:11,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:45:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:45:11,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:45:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:45:22,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:45:22,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 01:45:22,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 01:45:22,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-10-19 01:45:22,797 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 01:45:22,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:45:22,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2040044927, now seen corresponding path program 2 times [2024-10-19 01:45:22,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:45:22,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829650067] [2024-10-19 01:45:22,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:45:22,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:45:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:45:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:45:23,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 01:45:23,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829650067] [2024-10-19 01:45:23,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829650067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 01:45:23,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 01:45:23,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-19 01:45:23,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260988523] [2024-10-19 01:45:23,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 01:45:23,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-19 01:45:23,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 01:45:23,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-19 01:45:23,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-19 01:45:23,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:45:23,006 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 01:45:23,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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) [2024-10-19 01:45:23,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:45:23,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-19 01:45:23,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 01:45:23,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:46:06,768 INFO L85 PathProgramCache]: Analyzing trace with hash -916689, now seen corresponding path program 1 times [2024-10-19 01:46:06,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:46:06,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:46:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:46:06,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:46:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:47:12,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1351077165, now seen corresponding path program 1 times [2024-10-19 01:47:12,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:47:12,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:47:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:47:12,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:47:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:47:12,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1423480642, now seen corresponding path program 1 times [2024-10-19 01:47:12,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:47:12,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:47:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:47:12,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:47:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:47:12,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:47:12,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 01:47:12,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 01:47:12,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 01:47:12,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24 [2024-10-19 01:47:12,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 01:47:12,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:47:12,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1340464223, now seen corresponding path program 3 times [2024-10-19 01:47:12,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:47:12,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197934839] [2024-10-19 01:47:12,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:47:12,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:47:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 01:47:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 01:47:13,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 01:47:13,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197934839] [2024-10-19 01:47:13,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197934839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 01:47:13,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 01:47:13,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-19 01:47:13,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637377925] [2024-10-19 01:47:13,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 01:47:13,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-19 01:47:13,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 01:47:13,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-19 01:47:13,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-19 01:47:13,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:47:13,613 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 01:47:13,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 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) [2024-10-19 01:47:13,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:47:13,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-19 01:47:13,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 01:47:13,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 01:47:13,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 01:48:02,118 INFO L85 PathProgramCache]: Analyzing trace with hash -913968, now seen corresponding path program 1 times [2024-10-19 01:48:02,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:48:02,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:48:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:48:02,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:48:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:49:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 01:49:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 01:49:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 01:49:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 01:49:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 01:49:26,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,SelfDestructingSolverStorable26 [2024-10-19 01:49:26,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 01:49:26,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 01:49:26,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1215576317, now seen corresponding path program 4 times [2024-10-19 01:49:26,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 01:49:26,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417241857] [2024-10-19 01:49:26,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 01:49:26,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 01:49:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:49:26,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 01:49:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 01:49:26,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-19 01:49:26,421 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-19 01:49:26,422 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-10-19 01:49:26,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-10-19 01:49:26,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-10-19 01:49:26,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-10-19 01:49:26,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-10-19 01:49:26,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-19 01:49:26,439 INFO L414 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-19 01:49:26,442 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2024-10-19 01:49:26,530 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-19 01:49:26,530 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-19 01:49:26,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.10 01:49:26 BasicIcfg [2024-10-19 01:49:26,534 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-19 01:49:26,534 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-19 01:49:26,534 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-19 01:49:26,534 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-19 01:49:26,535 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 01:43:45" (3/4) ... [2024-10-19 01:49:26,535 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-19 01:49:26,616 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-10-19 01:49:26,616 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-19 01:49:26,616 INFO L158 Benchmark]: Toolchain (without parser) took 342061.83ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 94.5MB in the beginning and 671.9MB in the end (delta: -577.4MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-10-19 01:49:26,617 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-19 01:49:26,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.79ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 126.7MB in the end (delta: -32.4MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2024-10-19 01:49:26,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.78ms. Allocated memory is still 167.8MB. Free memory was 126.7MB in the beginning and 123.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 01:49:26,617 INFO L158 Benchmark]: Boogie Preprocessor took 43.63ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 121.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 01:49:26,617 INFO L158 Benchmark]: RCFGBuilder took 552.01ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 70.2MB in the end (delta: 51.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-19 01:49:26,618 INFO L158 Benchmark]: TraceAbstraction took 340808.84ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 68.1MB in the beginning and 691.8MB in the end (delta: -623.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-19 01:49:26,618 INFO L158 Benchmark]: Witness Printer took 81.82ms. Allocated memory is still 1.9GB. Free memory was 691.8MB in the beginning and 671.9MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-19 01:49:26,619 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 509.79ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 126.7MB in the end (delta: -32.4MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.78ms. Allocated memory is still 167.8MB. Free memory was 126.7MB in the beginning and 123.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.63ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 121.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 552.01ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 70.2MB in the end (delta: 51.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 340808.84ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 68.1MB in the beginning and 691.8MB in the end (delta: -623.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 81.82ms. Allocated memory is still 1.9GB. Free memory was 691.8MB in the beginning and 671.9MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 181667, independent: 179159, independent conditional: 177846, independent unconditional: 1313, dependent: 2508, dependent conditional: 2475, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 181503, independent: 179159, independent conditional: 177846, independent unconditional: 1313, dependent: 2344, dependent conditional: 2311, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 181503, independent: 179159, independent conditional: 177846, independent unconditional: 1313, dependent: 2344, dependent conditional: 2311, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 181503, independent: 179159, independent conditional: 177846, independent unconditional: 1313, dependent: 2344, dependent conditional: 2311, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 199682, independent: 179159, independent conditional: 177846, independent unconditional: 1313, dependent: 20523, dependent conditional: 20457, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 199682, independent: 179159, independent conditional: 51364, independent unconditional: 127795, dependent: 20523, dependent conditional: 650, dependent unconditional: 19873, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 199682, independent: 179159, independent conditional: 51364, independent unconditional: 127795, dependent: 20523, dependent conditional: 650, dependent unconditional: 19873, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4868, independent: 4627, independent conditional: 3404, independent unconditional: 1223, dependent: 241, dependent conditional: 207, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4868, independent: 1261, independent conditional: 0, independent unconditional: 1261, dependent: 3607, dependent conditional: 0, dependent unconditional: 3607, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3607, independent: 3366, independent conditional: 3351, independent unconditional: 15, dependent: 241, dependent conditional: 207, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3607, independent: 3366, independent conditional: 3351, independent unconditional: 15, dependent: 241, dependent conditional: 207, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 329764, independent: 272759, independent conditional: 272550, independent unconditional: 209, dependent: 57005, dependent conditional: 26634, dependent unconditional: 30371, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 199682, independent: 174532, independent conditional: 47960, independent unconditional: 126572, dependent: 20282, dependent conditional: 443, dependent unconditional: 19839, unknown: 4868, unknown conditional: 3611, unknown unconditional: 1257] , Statistics on independence cache: Total cache size (in pairs): 4868, Positive cache size: 4627, Positive conditional cache size: 3404, Positive unconditional cache size: 1223, Negative cache size: 241, Negative conditional cache size: 207, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 146289, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 199682, independent: 179159, independent conditional: 177846, independent unconditional: 1313, dependent: 20523, dependent conditional: 20457, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 199682, independent: 179159, independent conditional: 51364, independent unconditional: 127795, dependent: 20523, dependent conditional: 650, dependent unconditional: 19873, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 199682, independent: 179159, independent conditional: 51364, independent unconditional: 127795, dependent: 20523, dependent conditional: 650, dependent unconditional: 19873, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4868, independent: 4627, independent conditional: 3404, independent unconditional: 1223, dependent: 241, dependent conditional: 207, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4868, independent: 1261, independent conditional: 0, independent unconditional: 1261, dependent: 3607, dependent conditional: 0, dependent unconditional: 3607, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3607, independent: 3366, independent conditional: 3351, independent unconditional: 15, dependent: 241, dependent conditional: 207, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3607, independent: 3366, independent conditional: 3351, independent unconditional: 15, dependent: 241, dependent conditional: 207, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 329764, independent: 272759, independent conditional: 272550, independent unconditional: 209, dependent: 57005, dependent conditional: 26634, dependent unconditional: 30371, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 199682, independent: 174532, independent conditional: 47960, independent unconditional: 126572, dependent: 20282, dependent conditional: 443, dependent unconditional: 19839, unknown: 4868, unknown conditional: 3611, unknown unconditional: 1257] , Statistics on independence cache: Total cache size (in pairs): 4868, Positive cache size: 4627, Positive conditional cache size: 3404, Positive unconditional cache size: 1223, Negative cache size: 241, Negative conditional cache size: 207, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 146289 ], Independence queries for same thread: 164, Persistent sets #1 benchmarks: Persistent set computation time: 30.4s, Number of persistent set computation: 4345, Number of trivial persistent sets: 2296, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1256, independent: 1223, independent conditional: 0, independent unconditional: 1223, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 181667, independent: 179159, independent conditional: 177846, independent unconditional: 1313, dependent: 2508, dependent conditional: 2475, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 181503, independent: 179159, independent conditional: 177846, independent unconditional: 1313, dependent: 2344, dependent conditional: 2311, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 181503, independent: 179159, independent conditional: 177846, independent unconditional: 1313, dependent: 2344, dependent conditional: 2311, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 181503, independent: 179159, independent conditional: 177846, independent unconditional: 1313, dependent: 2344, dependent conditional: 2311, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 199682, independent: 179159, independent conditional: 177846, independent unconditional: 1313, dependent: 20523, dependent conditional: 20457, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 199682, independent: 179159, independent conditional: 51364, independent unconditional: 127795, dependent: 20523, dependent conditional: 650, dependent unconditional: 19873, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 199682, independent: 179159, independent conditional: 51364, independent unconditional: 127795, dependent: 20523, dependent conditional: 650, dependent unconditional: 19873, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4868, independent: 4627, independent conditional: 3404, independent unconditional: 1223, dependent: 241, dependent conditional: 207, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4868, independent: 1261, independent conditional: 0, independent unconditional: 1261, dependent: 3607, dependent conditional: 0, dependent unconditional: 3607, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3607, independent: 3366, independent conditional: 3351, independent unconditional: 15, dependent: 241, dependent conditional: 207, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3607, independent: 3366, independent conditional: 3351, independent unconditional: 15, dependent: 241, dependent conditional: 207, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 329764, independent: 272759, independent conditional: 272550, independent unconditional: 209, dependent: 57005, dependent conditional: 26634, dependent unconditional: 30371, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 199682, independent: 174532, independent conditional: 47960, independent unconditional: 126572, dependent: 20282, dependent conditional: 443, dependent unconditional: 19839, unknown: 4868, unknown conditional: 3611, unknown unconditional: 1257] , Statistics on independence cache: Total cache size (in pairs): 4868, Positive cache size: 4627, Positive conditional cache size: 3404, Positive unconditional cache size: 1223, Negative cache size: 241, Negative conditional cache size: 207, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 146289, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 199682, independent: 179159, independent conditional: 177846, independent unconditional: 1313, dependent: 20523, dependent conditional: 20457, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 199682, independent: 179159, independent conditional: 51364, independent unconditional: 127795, dependent: 20523, dependent conditional: 650, dependent unconditional: 19873, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 199682, independent: 179159, independent conditional: 51364, independent unconditional: 127795, dependent: 20523, dependent conditional: 650, dependent unconditional: 19873, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4868, independent: 4627, independent conditional: 3404, independent unconditional: 1223, dependent: 241, dependent conditional: 207, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4868, independent: 1261, independent conditional: 0, independent unconditional: 1261, dependent: 3607, dependent conditional: 0, dependent unconditional: 3607, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3607, independent: 3366, independent conditional: 3351, independent unconditional: 15, dependent: 241, dependent conditional: 207, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3607, independent: 3366, independent conditional: 3351, independent unconditional: 15, dependent: 241, dependent conditional: 207, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 329764, independent: 272759, independent conditional: 272550, independent unconditional: 209, dependent: 57005, dependent conditional: 26634, dependent unconditional: 30371, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 199682, independent: 174532, independent conditional: 47960, independent unconditional: 126572, dependent: 20282, dependent conditional: 443, dependent unconditional: 19839, unknown: 4868, unknown conditional: 3611, unknown unconditional: 1257] , Statistics on independence cache: Total cache size (in pairs): 4868, Positive cache size: 4627, Positive conditional cache size: 3404, Positive unconditional cache size: 1223, Negative cache size: 241, Negative conditional cache size: 207, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 146289 ], Independence queries for same thread: 164 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165=-1, t1166=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165=-1, t1166=0, t1167=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165=-1, t1166=0, t1167=1, t1168=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 return 0; [L782] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L797] 3 return 0; [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L833] 4 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165=-1, t1166=0, t1167=1, t1168=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165=-1, t1166=0, t1167=1, t1168=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165=-1, t1166=0, t1167=1, t1168=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 340.5s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 337.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: 30, 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.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 1541 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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, ConComCheckerStatistics: ConditionalCommutativityOverallTime: 0.0s, ConditionalCommutativityCheckTime: 298.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 26, ConditionalCommutativityTraceChecks: 21, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-10-19 01:49:26,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-10-19 01:49:26,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE