./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9047d35108a9c07c04b519cba211a741bb80887623b2a85c45105c17ca835121 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:29:11,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:29:11,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:29:11,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:29:11,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:29:11,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:29:11,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:29:11,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:29:11,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:29:11,470 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:29:11,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:29:11,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:29:11,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:29:11,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:29:11,473 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:29:11,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:29:11,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:29:11,473 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:29:11,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:29:11,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:29:11,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:29:11,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:29:11,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:29:11,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:29:11,475 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:29:11,475 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:29:11,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:29:11,476 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:29:11,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:29:11,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:29:11,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:29:11,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:29:11,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:29:11,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:29:11,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:29:11,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:29:11,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:29:11,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:29:11,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:29:11,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:29:11,479 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:29:11,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:29:11,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:29:11,480 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 -> Automizer 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 -> 9047d35108a9c07c04b519cba211a741bb80887623b2a85c45105c17ca835121 [2024-06-27 17:29:11,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:29:11,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:29:11,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:29:11,744 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:29:11,745 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:29:11,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2024-06-27 17:29:13,025 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:29:13,394 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:29:13,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2024-06-27 17:29:13,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aba57ea0/9424f7b0565e4a3ab4c824873a80264f/FLAGfba20d114 [2024-06-27 17:29:13,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aba57ea0/9424f7b0565e4a3ab4c824873a80264f [2024-06-27 17:29:13,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:29:13,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:29:13,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:29:13,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:29:13,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:29:13,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:29:13" (1/1) ... [2024-06-27 17:29:13,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132fbe3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:13, skipping insertion in model container [2024-06-27 17:29:13,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:29:13" (1/1) ... [2024-06-27 17:29:13,754 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:29:14,046 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/safe009_rmo.opt.i[949,962] [2024-06-27 17:29:14,241 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:29:14,253 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:29:14,277 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/safe009_rmo.opt.i[949,962] [2024-06-27 17:29:14,334 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:29:14,377 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:29:14,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:14 WrapperNode [2024-06-27 17:29:14,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:29:14,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:29:14,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:29:14,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:29:14,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:14" (1/1) ... [2024-06-27 17:29:14,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:14" (1/1) ... [2024-06-27 17:29:14,438 INFO L138 Inliner]: procedures = 175, calls = 57, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 124 [2024-06-27 17:29:14,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:29:14,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:29:14,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:29:14,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:29:14,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:14" (1/1) ... [2024-06-27 17:29:14,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:14" (1/1) ... [2024-06-27 17:29:14,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:14" (1/1) ... [2024-06-27 17:29:14,481 INFO L175 MemorySlicer]: Split 19 memory accesses to 2 slices as follows [2, 17]. 89 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 7 writes are split as follows [0, 7]. [2024-06-27 17:29:14,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:14" (1/1) ... [2024-06-27 17:29:14,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:14" (1/1) ... [2024-06-27 17:29:14,498 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:14" (1/1) ... [2024-06-27 17:29:14,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:14" (1/1) ... [2024-06-27 17:29:14,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:14" (1/1) ... [2024-06-27 17:29:14,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:14" (1/1) ... [2024-06-27 17:29:14,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:29:14,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:29:14,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:29:14,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:29:14,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:14" (1/1) ... [2024-06-27 17:29:14,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:29:14,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:29:14,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 17:29:14,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 17:29:14,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:29:14,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:29:14,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:29:14,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:29:14,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:29:14,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:29:14,594 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 17:29:14,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 17:29:14,594 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 17:29:14,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 17:29:14,595 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 17:29:14,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 17:29:14,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:29:14,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:29:14,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:29:14,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:29:14,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:29:14,596 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:29:14,710 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:29:14,711 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:29:15,024 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:29:15,025 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:29:15,278 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:29:15,278 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 17:29:15,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:29:15 BoogieIcfgContainer [2024-06-27 17:29:15,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:29:15,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:29:15,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:29:15,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:29:15,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:29:13" (1/3) ... [2024-06-27 17:29:15,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6301c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:29:15, skipping insertion in model container [2024-06-27 17:29:15,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:14" (2/3) ... [2024-06-27 17:29:15,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6301c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:29:15, skipping insertion in model container [2024-06-27 17:29:15,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:29:15" (3/3) ... [2024-06-27 17:29:15,285 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_rmo.opt.i [2024-06-27 17:29:15,292 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:29:15,300 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:29:15,300 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:29:15,300 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:29:15,345 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 17:29:15,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 86 flow [2024-06-27 17:29:15,399 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2024-06-27 17:29:15,400 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:29:15,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 1/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2024-06-27 17:29:15,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 37 transitions, 86 flow [2024-06-27 17:29:15,408 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow [2024-06-27 17:29:15,417 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:29:15,423 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, 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;@4424bdf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:29:15,423 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 17:29:15,432 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:29:15,433 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-27 17:29:15,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:29:15,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:15,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:15,434 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:29:15,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:15,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1721162947, now seen corresponding path program 1 times [2024-06-27 17:29:15,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:15,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957852677] [2024-06-27 17:29:15,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:15,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:15,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:15,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957852677] [2024-06-27 17:29:15,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957852677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:15,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:15,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:29:15,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659002857] [2024-06-27 17:29:15,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:15,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:29:15,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:15,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:29:15,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:29:15,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-27 17:29:15,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-06-27 17:29:15,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:15,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-27 17:29:15,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:16,340 INFO L124 PetriNetUnfolderBase]: 1517/2470 cut-off events. [2024-06-27 17:29:16,340 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-27 17:29:16,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4825 conditions, 2470 events. 1517/2470 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 14199 event pairs, 198 based on Foata normal form. 100/2549 useless extension candidates. Maximal degree in co-relation 4814. Up to 1316 conditions per place. [2024-06-27 17:29:16,353 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 42 selfloop transitions, 5 changer transitions 1/56 dead transitions. [2024-06-27 17:29:16,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 223 flow [2024-06-27 17:29:16,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:29:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:29:16,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2024-06-27 17:29:16,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6621621621621622 [2024-06-27 17:29:16,363 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 4 states and 98 transitions. [2024-06-27 17:29:16,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 223 flow [2024-06-27 17:29:16,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 218 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:29:16,368 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 102 flow [2024-06-27 17:29:16,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2024-06-27 17:29:16,372 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2024-06-27 17:29:16,372 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 102 flow [2024-06-27 17:29:16,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-06-27 17:29:16,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:16,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:16,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:29:16,373 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:29:16,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:16,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1610551057, now seen corresponding path program 1 times [2024-06-27 17:29:16,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:16,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666001011] [2024-06-27 17:29:16,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:16,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:16,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:16,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:16,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666001011] [2024-06-27 17:29:16,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666001011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:16,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:16,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:29:16,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880096635] [2024-06-27 17:29:16,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:16,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:29:16,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:16,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:29:16,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:29:16,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-27 17:29:16,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-06-27 17:29:16,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:16,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-27 17:29:16,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:16,784 INFO L124 PetriNetUnfolderBase]: 980/1621 cut-off events. [2024-06-27 17:29:16,785 INFO L125 PetriNetUnfolderBase]: For 399/399 co-relation queries the response was YES. [2024-06-27 17:29:16,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3768 conditions, 1621 events. 980/1621 cut-off events. For 399/399 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8275 event pairs, 110 based on Foata normal form. 82/1682 useless extension candidates. Maximal degree in co-relation 3756. Up to 581 conditions per place. [2024-06-27 17:29:16,791 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 53 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2024-06-27 17:29:16,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 319 flow [2024-06-27 17:29:16,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:29:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:29:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-06-27 17:29:16,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6702702702702703 [2024-06-27 17:29:16,793 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 102 flow. Second operand 5 states and 124 transitions. [2024-06-27 17:29:16,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 319 flow [2024-06-27 17:29:16,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 309 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 17:29:16,796 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 142 flow [2024-06-27 17:29:16,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-06-27 17:29:16,797 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2024-06-27 17:29:16,797 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 142 flow [2024-06-27 17:29:16,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-06-27 17:29:16,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:16,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:16,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:29:16,798 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:29:16,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:16,798 INFO L85 PathProgramCache]: Analyzing trace with hash -584929319, now seen corresponding path program 1 times [2024-06-27 17:29:16,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:16,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113225197] [2024-06-27 17:29:16,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:16,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:16,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:16,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113225197] [2024-06-27 17:29:16,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113225197] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:16,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:16,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:29:16,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761453755] [2024-06-27 17:29:16,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:16,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:29:16,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:16,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:29:16,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:29:16,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-27 17:29:16,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-06-27 17:29:16,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:16,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-27 17:29:16,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:17,153 INFO L124 PetriNetUnfolderBase]: 587/962 cut-off events. [2024-06-27 17:29:17,154 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2024-06-27 17:29:17,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2520 conditions, 962 events. 587/962 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4275 event pairs, 93 based on Foata normal form. 40/981 useless extension candidates. Maximal degree in co-relation 2506. Up to 308 conditions per place. [2024-06-27 17:29:17,158 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 46 selfloop transitions, 11 changer transitions 1/66 dead transitions. [2024-06-27 17:29:17,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 326 flow [2024-06-27 17:29:17,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:29:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:29:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2024-06-27 17:29:17,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2024-06-27 17:29:17,164 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 142 flow. Second operand 6 states and 132 transitions. [2024-06-27 17:29:17,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 66 transitions, 326 flow [2024-06-27 17:29:17,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 301 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 17:29:17,169 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 156 flow [2024-06-27 17:29:17,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2024-06-27 17:29:17,171 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-06-27 17:29:17,171 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 156 flow [2024-06-27 17:29:17,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-06-27 17:29:17,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:17,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:17,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:29:17,172 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:29:17,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:17,173 INFO L85 PathProgramCache]: Analyzing trace with hash -2094996719, now seen corresponding path program 1 times [2024-06-27 17:29:17,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:17,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273899827] [2024-06-27 17:29:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:17,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:17,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:17,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:17,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273899827] [2024-06-27 17:29:17,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273899827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:17,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:17,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:29:17,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054404236] [2024-06-27 17:29:17,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:17,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:29:17,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:17,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:29:17,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:29:17,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-27 17:29:17,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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-06-27 17:29:17,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:17,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-27 17:29:17,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:17,640 INFO L124 PetriNetUnfolderBase]: 995/1727 cut-off events. [2024-06-27 17:29:17,640 INFO L125 PetriNetUnfolderBase]: For 750/770 co-relation queries the response was YES. [2024-06-27 17:29:17,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4074 conditions, 1727 events. 995/1727 cut-off events. For 750/770 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9208 event pairs, 219 based on Foata normal form. 8/1695 useless extension candidates. Maximal degree in co-relation 4059. Up to 680 conditions per place. [2024-06-27 17:29:17,646 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 35 selfloop transitions, 4 changer transitions 17/70 dead transitions. [2024-06-27 17:29:17,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 346 flow [2024-06-27 17:29:17,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:29:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:29:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-06-27 17:29:17,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.581081081081081 [2024-06-27 17:29:17,648 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 156 flow. Second operand 6 states and 129 transitions. [2024-06-27 17:29:17,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 346 flow [2024-06-27 17:29:17,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 70 transitions, 282 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-27 17:29:17,654 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 128 flow [2024-06-27 17:29:17,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2024-06-27 17:29:17,655 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2024-06-27 17:29:17,655 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 128 flow [2024-06-27 17:29:17,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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-06-27 17:29:17,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:17,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:17,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:29:17,656 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:29:17,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:17,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1055675427, now seen corresponding path program 2 times [2024-06-27 17:29:17,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:17,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819889660] [2024-06-27 17:29:17,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:17,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:29:17,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 17:29:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:29:17,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 17:29:17,778 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 17:29:17,779 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-06-27 17:29:17,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-06-27 17:29:17,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-27 17:29:17,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-27 17:29:17,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:29:17,781 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-06-27 17:29:17,785 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:29:17,785 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:29:17,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:29:17 BasicIcfg [2024-06-27 17:29:17,845 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:29:17,846 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 17:29:17,846 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 17:29:17,846 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 17:29:17,846 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:29:15" (3/4) ... [2024-06-27 17:29:17,847 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-06-27 17:29:17,913 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 17:29:17,913 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 17:29:17,913 INFO L158 Benchmark]: Toolchain (without parser) took 4279.85ms. Allocated memory was 159.4MB in the beginning and 352.3MB in the end (delta: 192.9MB). Free memory was 98.4MB in the beginning and 206.4MB in the end (delta: -108.0MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2024-06-27 17:29:17,914 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:29:17,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.01ms. Allocated memory is still 159.4MB. Free memory was 98.4MB in the beginning and 111.8MB in the end (delta: -13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-06-27 17:29:17,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.65ms. Allocated memory is still 159.4MB. Free memory was 111.8MB in the beginning and 109.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:29:17,914 INFO L158 Benchmark]: Boogie Preprocessor took 79.60ms. Allocated memory is still 159.4MB. Free memory was 109.0MB in the beginning and 105.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:29:17,915 INFO L158 Benchmark]: RCFGBuilder took 759.11ms. Allocated memory was 159.4MB in the beginning and 270.5MB in the end (delta: 111.1MB). Free memory was 105.5MB in the beginning and 214.7MB in the end (delta: -109.1MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2024-06-27 17:29:17,915 INFO L158 Benchmark]: TraceAbstraction took 2565.12ms. Allocated memory was 270.5MB in the beginning and 352.3MB in the end (delta: 81.8MB). Free memory was 214.7MB in the beginning and 224.2MB in the end (delta: -9.5MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2024-06-27 17:29:17,915 INFO L158 Benchmark]: Witness Printer took 67.34ms. Allocated memory is still 352.3MB. Free memory was 224.2MB in the beginning and 206.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-06-27 17:29:17,916 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.14ms. Allocated memory is still 104.9MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.01ms. Allocated memory is still 159.4MB. Free memory was 98.4MB in the beginning and 111.8MB in the end (delta: -13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.65ms. Allocated memory is still 159.4MB. Free memory was 111.8MB in the beginning and 109.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.60ms. Allocated memory is still 159.4MB. Free memory was 109.0MB in the beginning and 105.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 759.11ms. Allocated memory was 159.4MB in the beginning and 270.5MB in the end (delta: 111.1MB). Free memory was 105.5MB in the beginning and 214.7MB in the end (delta: -109.1MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2565.12ms. Allocated memory was 270.5MB in the beginning and 352.3MB in the end (delta: 81.8MB). Free memory was 214.7MB in the beginning and 224.2MB in the end (delta: -9.5MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. * Witness Printer took 67.34ms. Allocated memory is still 352.3MB. Free memory was 224.2MB in the beginning and 206.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L730] 0 _Bool main$tmp_guard0; [L731] 0 _Bool main$tmp_guard1; [L733] 0 int x = 0; [L733] 0 int x = 0; [L734] 0 _Bool x$flush_delayed; [L735] 0 int x$mem_tmp; [L736] 0 _Bool x$r_buff0_thd0; [L737] 0 _Bool x$r_buff0_thd1; [L738] 0 _Bool x$r_buff0_thd2; [L739] 0 _Bool x$r_buff0_thd3; [L740] 0 _Bool x$r_buff1_thd0; [L741] 0 _Bool x$r_buff1_thd1; [L742] 0 _Bool x$r_buff1_thd2; [L743] 0 _Bool x$r_buff1_thd3; [L744] 0 _Bool x$read_delayed; [L745] 0 int *x$read_delayed_var; [L746] 0 int x$w_buff0; [L747] 0 _Bool x$w_buff0_used; [L748] 0 int x$w_buff1; [L749] 0 _Bool x$w_buff1_used; [L751] 0 int y = 0; [L752] 0 _Bool weak$$choice0; [L753] 0 _Bool weak$$choice1; [L754] 0 _Bool weak$$choice2; [L838] 0 pthread_t t2000; [L839] FCALL, FORK 0 pthread_create(&t2000, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2000=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L840] 0 pthread_t t2001; [L841] FCALL, FORK 0 pthread_create(&t2001, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2000=-2, t2001=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L778] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L779] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L780] 2 x$flush_delayed = weak$$choice2 [L781] EXPR 2 \read(x) [L781] 2 x$mem_tmp = x [L782] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L782] EXPR 2 \read(x) [L782] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L782] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L783] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L784] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L785] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L786] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L788] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L790] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L791] EXPR 2 \read(x) [L791] 2 __unbuffered_p1_EAX = x [L792] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L792] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L792] 2 x = x$flush_delayed ? x$mem_tmp : x [L793] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L842] 0 pthread_t t2002; [L843] FCALL, FORK 0 pthread_create(&t2002, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2000=-2, t2001=-1, t2002=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L796] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L799] EXPR 2 \read(x) [L799] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L800] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L801] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L802] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L803] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L813] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L816] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L816] EXPR 3 \read(x) [L816] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L816] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L819] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L758] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L761] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L764] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L764] EXPR 1 \read(x) [L764] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L764] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L765] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L766] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L767] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L768] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2000=-2, t2001=-1, t2002=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L849] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L849] EXPR 0 \read(x) [L849] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L849] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L850] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L851] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L852] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L853] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2000=-2, t2001=-1, t2002=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L856] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L857] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L857] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L857] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L857] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L857] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L857] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L858] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2000=-2, t2001=-1, t2002=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L860] 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, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 843]: 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: 841]: 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: 839]: 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 with 1 thread instances CFG has 7 procedures, 60 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.4s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 239 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 225 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 346 IncrementalHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 12 mSDtfsCounter, 346 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=3, InterpolantAutomatonStates: 21, 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.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 RESULT: Ultimate proved your program to be incorrect! [2024-06-27 17:29:17,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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