./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/thin002_rmo.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread-wmm/thin002_rmo.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 f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:33:33,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:33:33,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:33:33,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:33:33,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:33:33,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:33:33,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:33:33,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:33:33,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:33:33,707 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:33:33,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:33:33,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:33:33,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:33:33,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:33:33,709 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:33:33,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:33:33,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:33:33,713 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:33:33,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:33:33,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:33:33,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:33:33,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:33:33,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:33:33,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:33:33,718 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:33:33,719 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:33:33,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:33:33,719 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:33:33,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:33:33,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:33:33,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:33:33,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:33:33,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:33:33,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:33:33,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:33:33,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:33:33,722 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:33:33,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:33:33,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:33:33,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:33:33,723 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:33:33,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:33:33,723 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 -> f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 [2024-11-09 02:33:34,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:33:34,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:33:34,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:33:34,030 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:33:34,030 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:33:34,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/thin002_rmo.i [2024-11-09 02:33:35,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:33:35,849 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:33:35,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/thin002_rmo.i [2024-11-09 02:33:35,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b28ee4d/9f7218a6d02c482f9ce4d5fa62cdd87f/FLAGceed24971 [2024-11-09 02:33:35,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b28ee4d/9f7218a6d02c482f9ce4d5fa62cdd87f [2024-11-09 02:33:35,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:33:35,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:33:35,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:33:35,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:33:35,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:33:35,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:33:35" (1/1) ... [2024-11-09 02:33:35,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3650c790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:35, skipping insertion in model container [2024-11-09 02:33:35,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:33:35" (1/1) ... [2024-11-09 02:33:35,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:33:36,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/thin002_rmo.i[988,1001] [2024-11-09 02:33:36,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:33:36,385 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:33:36,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/thin002_rmo.i[988,1001] [2024-11-09 02:33:36,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:33:36,513 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:33:36,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:36 WrapperNode [2024-11-09 02:33:36,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:33:36,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:33:36,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:33:36,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:33:36,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:36" (1/1) ... [2024-11-09 02:33:36,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:36" (1/1) ... [2024-11-09 02:33:36,575 INFO L138 Inliner]: procedures = 176, calls = 64, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 139 [2024-11-09 02:33:36,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:33:36,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:33:36,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:33:36,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:33:36,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:36" (1/1) ... [2024-11-09 02:33:36,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:36" (1/1) ... [2024-11-09 02:33:36,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:36" (1/1) ... [2024-11-09 02:33:36,614 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-11-09 02:33:36,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:36" (1/1) ... [2024-11-09 02:33:36,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:36" (1/1) ... [2024-11-09 02:33:36,622 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:36" (1/1) ... [2024-11-09 02:33:36,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:36" (1/1) ... [2024-11-09 02:33:36,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:36" (1/1) ... [2024-11-09 02:33:36,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:36" (1/1) ... [2024-11-09 02:33:36,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:33:36,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:33:36,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:33:36,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:33:36,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:36" (1/1) ... [2024-11-09 02:33:36,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:33:36,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:33:36,681 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-11-09 02:33:36,683 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-11-09 02:33:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 02:33:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 02:33:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 02:33:36,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 02:33:36,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 02:33:36,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:33:36,732 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 02:33:36,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 02:33:36,732 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 02:33:36,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 02:33:36,733 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 02:33:36,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 02:33:36,733 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-09 02:33:36,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-09 02:33:36,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 02:33:36,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 02:33:36,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 02:33:36,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:33:36,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:33:36,736 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 02:33:36,890 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:33:36,892 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:33:37,287 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 02:33:37,288 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:33:37,606 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:33:37,607 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 02:33:37,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:33:37 BoogieIcfgContainer [2024-11-09 02:33:37,608 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:33:37,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:33:37,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:33:37,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:33:37,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:33:35" (1/3) ... [2024-11-09 02:33:37,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@914d435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:33:37, skipping insertion in model container [2024-11-09 02:33:37,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:33:36" (2/3) ... [2024-11-09 02:33:37,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@914d435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:33:37, skipping insertion in model container [2024-11-09 02:33:37,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:33:37" (3/3) ... [2024-11-09 02:33:37,616 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_rmo.i [2024-11-09 02:33:37,635 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:33:37,635 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:33:37,635 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 02:33:37,703 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 02:33:37,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 47 transitions, 110 flow [2024-11-09 02:33:37,783 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2024-11-09 02:33:37,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 02:33:37,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 43 events. 1/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-11-09 02:33:37,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 47 transitions, 110 flow [2024-11-09 02:33:37,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 40 transitions, 92 flow [2024-11-09 02:33:37,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:33:37,809 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@6af1874f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:33:37,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-09 02:33:37,826 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:33:37,827 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-11-09 02:33:37,827 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 02:33:37,827 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:33:37,828 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:33:37,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:33:37,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:33:37,835 INFO L85 PathProgramCache]: Analyzing trace with hash -515221074, now seen corresponding path program 1 times [2024-11-09 02:33:37,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:33:37,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676773776] [2024-11-09 02:33:37,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:33:37,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:33:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:33:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:33:38,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:33:38,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676773776] [2024-11-09 02:33:38,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676773776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:33:38,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:33:38,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:33:38,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095788387] [2024-11-09 02:33:38,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:33:38,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:33:38,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:33:38,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:33:38,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:33:38,611 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-11-09 02:33:38,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-11-09 02:33:38,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:33:38,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-11-09 02:33:38,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:33:39,692 INFO L124 PetriNetUnfolderBase]: 3869/5755 cut-off events. [2024-11-09 02:33:39,694 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-09 02:33:39,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11251 conditions, 5755 events. 3869/5755 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 35977 event pairs, 540 based on Foata normal form. 180/5911 useless extension candidates. Maximal degree in co-relation 11239. Up to 3346 conditions per place. [2024-11-09 02:33:39,756 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 44 selfloop transitions, 6 changer transitions 1/66 dead transitions. [2024-11-09 02:33:39,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 255 flow [2024-11-09 02:33:39,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:33:39,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 02:33:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-11-09 02:33:39,772 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7074468085106383 [2024-11-09 02:33:39,775 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 92 flow. Second operand 4 states and 133 transitions. [2024-11-09 02:33:39,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 255 flow [2024-11-09 02:33:39,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 66 transitions, 248 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 02:33:39,787 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 130 flow [2024-11-09 02:33:39,790 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2024-11-09 02:33:39,795 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2024-11-09 02:33:39,796 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 130 flow [2024-11-09 02:33:39,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-11-09 02:33:39,796 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:33:39,797 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:33:39,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:33:39,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:33:39,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:33:39,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1490168778, now seen corresponding path program 1 times [2024-11-09 02:33:39,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:33:39,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770108489] [2024-11-09 02:33:39,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:33:39,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:33:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:33:40,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:33:40,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:33:40,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770108489] [2024-11-09 02:33:40,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770108489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:33:40,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:33:40,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:33:40,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724152608] [2024-11-09 02:33:40,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:33:40,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:33:40,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:33:40,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:33:40,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:33:40,281 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-11-09 02:33:40,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-11-09 02:33:40,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:33:40,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-11-09 02:33:40,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:33:41,248 INFO L124 PetriNetUnfolderBase]: 3284/4926 cut-off events. [2024-11-09 02:33:41,248 INFO L125 PetriNetUnfolderBase]: For 1395/1423 co-relation queries the response was YES. [2024-11-09 02:33:41,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11589 conditions, 4926 events. 3284/4926 cut-off events. For 1395/1423 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 29475 event pairs, 196 based on Foata normal form. 178/5082 useless extension candidates. Maximal degree in co-relation 11577. Up to 2581 conditions per place. [2024-11-09 02:33:41,286 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 56 selfloop transitions, 10 changer transitions 1/82 dead transitions. [2024-11-09 02:33:41,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 369 flow [2024-11-09 02:33:41,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:33:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:33:41,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-11-09 02:33:41,292 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7191489361702128 [2024-11-09 02:33:41,293 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 130 flow. Second operand 5 states and 169 transitions. [2024-11-09 02:33:41,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 369 flow [2024-11-09 02:33:41,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 358 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 02:33:41,298 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 182 flow [2024-11-09 02:33:41,299 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2024-11-09 02:33:41,300 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2024-11-09 02:33:41,300 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 182 flow [2024-11-09 02:33:41,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-11-09 02:33:41,301 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:33:41,301 INFO L204 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] [2024-11-09 02:33:41,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:33:41,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:33:41,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:33:41,304 INFO L85 PathProgramCache]: Analyzing trace with hash -19643642, now seen corresponding path program 1 times [2024-11-09 02:33:41,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:33:41,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401382434] [2024-11-09 02:33:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:33:41,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:33:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:33:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:33:41,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:33:41,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401382434] [2024-11-09 02:33:41,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401382434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:33:41,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:33:41,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:33:41,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59950690] [2024-11-09 02:33:41,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:33:41,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:33:41,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:33:41,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:33:41,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:33:41,588 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-11-09 02:33:41,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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-11-09 02:33:41,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:33:41,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-11-09 02:33:41,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:33:42,155 INFO L124 PetriNetUnfolderBase]: 2213/3345 cut-off events. [2024-11-09 02:33:42,155 INFO L125 PetriNetUnfolderBase]: For 2762/2823 co-relation queries the response was YES. [2024-11-09 02:33:42,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8881 conditions, 3345 events. 2213/3345 cut-off events. For 2762/2823 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 17877 event pairs, 73 based on Foata normal form. 148/3471 useless extension candidates. Maximal degree in co-relation 8867. Up to 1221 conditions per place. [2024-11-09 02:33:42,212 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 66 selfloop transitions, 14 changer transitions 1/96 dead transitions. [2024-11-09 02:33:42,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 96 transitions, 488 flow [2024-11-09 02:33:42,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:33:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:33:42,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2024-11-09 02:33:42,215 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7198581560283688 [2024-11-09 02:33:42,215 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 182 flow. Second operand 6 states and 203 transitions. [2024-11-09 02:33:42,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 96 transitions, 488 flow [2024-11-09 02:33:42,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 96 transitions, 458 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 02:33:42,227 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 232 flow [2024-11-09 02:33:42,227 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2024-11-09 02:33:42,228 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2024-11-09 02:33:42,228 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 232 flow [2024-11-09 02:33:42,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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-11-09 02:33:42,230 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:33:42,230 INFO L204 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, 1, 1, 1] [2024-11-09 02:33:42,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:33:42,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:33:42,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:33:42,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1900760944, now seen corresponding path program 1 times [2024-11-09 02:33:42,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:33:42,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622959560] [2024-11-09 02:33:42,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:33:42,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:33:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:33:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:33:42,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:33:42,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622959560] [2024-11-09 02:33:42,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622959560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:33:42,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:33:42,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:33:42,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377849558] [2024-11-09 02:33:42,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:33:42,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:33:42,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:33:42,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:33:42,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:33:42,514 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-11-09 02:33:42,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 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-11-09 02:33:42,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:33:42,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-11-09 02:33:42,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:33:42,934 INFO L124 PetriNetUnfolderBase]: 1365/2037 cut-off events. [2024-11-09 02:33:42,934 INFO L125 PetriNetUnfolderBase]: For 3065/3126 co-relation queries the response was YES. [2024-11-09 02:33:42,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6082 conditions, 2037 events. 1365/2037 cut-off events. For 3065/3126 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9357 event pairs, 43 based on Foata normal form. 80/2095 useless extension candidates. Maximal degree in co-relation 6067. Up to 668 conditions per place. [2024-11-09 02:33:42,949 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 60 selfloop transitions, 18 changer transitions 1/94 dead transitions. [2024-11-09 02:33:42,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 490 flow [2024-11-09 02:33:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:33:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 02:33:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions. [2024-11-09 02:33:42,951 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6717325227963525 [2024-11-09 02:33:42,951 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 232 flow. Second operand 7 states and 221 transitions. [2024-11-09 02:33:42,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 490 flow [2024-11-09 02:33:42,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 94 transitions, 444 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-09 02:33:42,966 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 242 flow [2024-11-09 02:33:42,966 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=242, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2024-11-09 02:33:42,967 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2024-11-09 02:33:42,967 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 242 flow [2024-11-09 02:33:42,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 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-11-09 02:33:42,968 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:33:42,968 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:33:42,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:33:42,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:33:42,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:33:42,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1698497012, now seen corresponding path program 1 times [2024-11-09 02:33:42,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:33:42,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685476653] [2024-11-09 02:33:42,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:33:42,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:33:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:33:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:33:43,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:33:43,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685476653] [2024-11-09 02:33:43,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685476653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:33:43,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:33:43,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:33:43,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289622823] [2024-11-09 02:33:43,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:33:43,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:33:43,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:33:43,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:33:43,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:33:43,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-11-09 02:33:43,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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-11-09 02:33:43,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:33:43,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-11-09 02:33:43,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:33:43,838 INFO L124 PetriNetUnfolderBase]: 1489/2503 cut-off events. [2024-11-09 02:33:43,839 INFO L125 PetriNetUnfolderBase]: For 1522/1598 co-relation queries the response was YES. [2024-11-09 02:33:43,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6054 conditions, 2503 events. 1489/2503 cut-off events. For 1522/1598 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 14705 event pairs, 287 based on Foata normal form. 16/2324 useless extension candidates. Maximal degree in co-relation 6038. Up to 870 conditions per place. [2024-11-09 02:33:43,863 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 38 selfloop transitions, 3 changer transitions 12/82 dead transitions. [2024-11-09 02:33:43,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 82 transitions, 420 flow [2024-11-09 02:33:43,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:33:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:33:43,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2024-11-09 02:33:43,865 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-11-09 02:33:43,866 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 242 flow. Second operand 6 states and 186 transitions. [2024-11-09 02:33:43,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 82 transitions, 420 flow [2024-11-09 02:33:43,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 314 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-11-09 02:33:43,877 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 164 flow [2024-11-09 02:33:43,878 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2024-11-09 02:33:43,878 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2024-11-09 02:33:43,880 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 164 flow [2024-11-09 02:33:43,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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-11-09 02:33:43,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:33:43,880 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:33:43,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:33:43,881 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:33:43,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:33:43,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1449690564, now seen corresponding path program 2 times [2024-11-09 02:33:43,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:33:43,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429498604] [2024-11-09 02:33:43,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:33:43,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:33:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:33:44,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:33:44,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:33:44,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429498604] [2024-11-09 02:33:44,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429498604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:33:44,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:33:44,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:33:44,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347711427] [2024-11-09 02:33:44,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:33:44,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:33:44,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:33:44,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:33:44,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:33:44,218 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-11-09 02:33:44,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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-11-09 02:33:44,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:33:44,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-11-09 02:33:44,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:33:44,871 INFO L124 PetriNetUnfolderBase]: 2844/4979 cut-off events. [2024-11-09 02:33:44,871 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2024-11-09 02:33:44,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9941 conditions, 4979 events. 2844/4979 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 34855 event pairs, 681 based on Foata normal form. 16/4632 useless extension candidates. Maximal degree in co-relation 9927. Up to 1668 conditions per place. [2024-11-09 02:33:44,904 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 39 selfloop transitions, 3 changer transitions 15/87 dead transitions. [2024-11-09 02:33:44,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 87 transitions, 356 flow [2024-11-09 02:33:44,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:33:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:33:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2024-11-09 02:33:44,906 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6737588652482269 [2024-11-09 02:33:44,906 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 164 flow. Second operand 6 states and 190 transitions. [2024-11-09 02:33:44,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 87 transitions, 356 flow [2024-11-09 02:33:44,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 346 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-09 02:33:44,912 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 170 flow [2024-11-09 02:33:44,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2024-11-09 02:33:44,914 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2024-11-09 02:33:44,915 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 170 flow [2024-11-09 02:33:44,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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-11-09 02:33:44,916 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:33:44,916 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:33:44,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:33:44,916 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:33:44,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:33:44,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1023685124, now seen corresponding path program 3 times [2024-11-09 02:33:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:33:44,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425886781] [2024-11-09 02:33:44,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:33:44,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:33:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:33:45,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:33:45,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:33:45,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425886781] [2024-11-09 02:33:45,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425886781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:33:45,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:33:45,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:33:45,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304092168] [2024-11-09 02:33:45,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:33:45,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:33:45,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:33:45,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:33:45,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:33:45,238 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-11-09 02:33:45,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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-11-09 02:33:45,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:33:45,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-11-09 02:33:45,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:33:45,777 INFO L124 PetriNetUnfolderBase]: 2410/4236 cut-off events. [2024-11-09 02:33:45,777 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-09 02:33:45,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8514 conditions, 4236 events. 2410/4236 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 28713 event pairs, 1023 based on Foata normal form. 16/3793 useless extension candidates. Maximal degree in co-relation 8499. Up to 1248 conditions per place. [2024-11-09 02:33:45,795 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 35 selfloop transitions, 3 changer transitions 21/89 dead transitions. [2024-11-09 02:33:45,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 376 flow [2024-11-09 02:33:45,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:33:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:33:45,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2024-11-09 02:33:45,797 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6808510638297872 [2024-11-09 02:33:45,797 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 170 flow. Second operand 6 states and 192 transitions. [2024-11-09 02:33:45,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 376 flow [2024-11-09 02:33:45,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 89 transitions, 360 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-09 02:33:45,801 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 172 flow [2024-11-09 02:33:45,802 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2024-11-09 02:33:45,802 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2024-11-09 02:33:45,803 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 172 flow [2024-11-09 02:33:45,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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-11-09 02:33:45,803 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:33:45,803 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:33:45,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:33:45,804 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:33:45,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:33:45,804 INFO L85 PathProgramCache]: Analyzing trace with hash 599146052, now seen corresponding path program 4 times [2024-11-09 02:33:45,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:33:45,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100685726] [2024-11-09 02:33:45,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:33:45,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:33:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:33:45,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:33:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:33:45,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:33:45,980 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:33:45,981 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-09 02:33:45,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-11-09 02:33:45,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-09 02:33:45,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-09 02:33:45,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-11-09 02:33:45,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:33:45,984 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-11-09 02:33:46,117 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 02:33:46,120 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:33:46,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:33:46 BasicIcfg [2024-11-09 02:33:46,127 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:33:46,127 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:33:46,128 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:33:46,128 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:33:46,129 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:33:37" (3/4) ... [2024-11-09 02:33:46,129 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 02:33:46,256 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 02:33:46,256 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:33:46,257 INFO L158 Benchmark]: Toolchain (without parser) took 10368.50ms. Allocated memory was 140.5MB in the beginning and 578.8MB in the end (delta: 438.3MB). Free memory was 105.4MB in the beginning and 333.4MB in the end (delta: -228.0MB). Peak memory consumption was 211.8MB. Max. memory is 16.1GB. [2024-11-09 02:33:46,257 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 140.5MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:33:46,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.63ms. Allocated memory is still 140.5MB. Free memory was 104.9MB in the beginning and 78.9MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 02:33:46,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.12ms. Allocated memory is still 140.5MB. Free memory was 78.9MB in the beginning and 76.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:33:46,258 INFO L158 Benchmark]: Boogie Preprocessor took 63.42ms. Allocated memory is still 140.5MB. Free memory was 76.5MB in the beginning and 73.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:33:46,258 INFO L158 Benchmark]: RCFGBuilder took 963.07ms. Allocated memory was 140.5MB in the beginning and 176.2MB in the end (delta: 35.7MB). Free memory was 72.6MB in the beginning and 108.0MB in the end (delta: -35.4MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2024-11-09 02:33:46,258 INFO L158 Benchmark]: TraceAbstraction took 8517.47ms. Allocated memory was 176.2MB in the beginning and 578.8MB in the end (delta: 402.7MB). Free memory was 107.0MB in the beginning and 358.5MB in the end (delta: -251.6MB). Peak memory consumption was 151.1MB. Max. memory is 16.1GB. [2024-11-09 02:33:46,258 INFO L158 Benchmark]: Witness Printer took 128.88ms. Allocated memory is still 578.8MB. Free memory was 358.5MB in the beginning and 333.4MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 02:33:46,262 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.17ms. Allocated memory is still 140.5MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 624.63ms. Allocated memory is still 140.5MB. Free memory was 104.9MB in the beginning and 78.9MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.12ms. Allocated memory is still 140.5MB. Free memory was 78.9MB in the beginning and 76.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.42ms. Allocated memory is still 140.5MB. Free memory was 76.5MB in the beginning and 73.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 963.07ms. Allocated memory was 140.5MB in the beginning and 176.2MB in the end (delta: 35.7MB). Free memory was 72.6MB in the beginning and 108.0MB in the end (delta: -35.4MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8517.47ms. Allocated memory was 176.2MB in the beginning and 578.8MB in the end (delta: 402.7MB). Free memory was 107.0MB in the beginning and 358.5MB in the end (delta: -251.6MB). Peak memory consumption was 151.1MB. Max. memory is 16.1GB. * Witness Printer took 128.88ms. Allocated memory is still 578.8MB. Free memory was 358.5MB in the beginning and 333.4MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p1_EAX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p3_EAX = 0; [L739] 0 int a = 0; [L739] 0 int a = 0; [L740] 0 _Bool a$flush_delayed; [L741] 0 int a$mem_tmp; [L742] 0 _Bool a$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L744] 0 _Bool a$r_buff0_thd2; [L745] 0 _Bool a$r_buff0_thd3; [L746] 0 _Bool a$r_buff0_thd4; [L747] 0 _Bool a$r_buff1_thd0; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L752] 0 _Bool a$read_delayed; [L753] 0 int *a$read_delayed_var; [L754] 0 int a$w_buff0; [L755] 0 _Bool a$w_buff0_used; [L756] 0 int a$w_buff1; [L757] 0 _Bool a$w_buff1_used; [L758] 0 _Bool main$tmp_guard0; [L759] 0 _Bool main$tmp_guard1; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L860] 0 pthread_t t2721; [L861] FCALL, FORK 0 pthread_create(&t2721, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2721=-3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] EXPR 1 \read(a) [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] 1 a = !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L777] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L778] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L779] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L780] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L781] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L782] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L783] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L784] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L785] EXPR 1 \read(a) [L785] 1 __unbuffered_p0_EAX = a [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] 1 a = a$flush_delayed ? a$mem_tmp : a [L787] 1 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z=0] [L862] 0 pthread_t t2722; [L863] FCALL, FORK 0 pthread_create(&t2722, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2721=-3, t2722=-2, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z=0] [L864] 0 pthread_t t2723; [L865] FCALL, FORK 0 pthread_create(&t2723, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2721=-3, t2722=-2, t2723=-1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z=0] [L866] 0 pthread_t t2724; [L867] FCALL, FORK 0 pthread_create(&t2724, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2721=-3, t2722=-2, t2723=-1, t2724=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z=0] [L790] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y=0, z=0] [L802] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y=0, z=0] [L805] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z=0] [L795] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z=0] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z=0] [L817] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z=0] [L820] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z=1] [L835] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z=1] [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 \read(a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L841] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z=1] [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z=1] [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2721=-3, t2722=-2, t2723=-1, t2724=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z=1] [L871] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L871] RET 0 assume_abort_if_not(main$tmp_guard0) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 \read(a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L876] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2721=-3, t2722=-2, t2723=-1, t2724=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z=1] [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2721=-3, t2722=-2, t2723=-1, t2724=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z=1] [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z=1] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 863]: 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: 861]: 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: 867]: 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: 865]: 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 9 procedures, 79 locations, 5 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: 8.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 472 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 452 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 756 IncrementalHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 7 mSDtfsCounter, 756 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=242occurred in iteration=4, InterpolantAutomatonStates: 40, 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.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 595 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-11-09 02:33:46,294 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