./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe025_rmo.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe025_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 245f8deca690daafc67ff44dd7680fe4934c4e890117db34905ca3a31fc7577b --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:29:52,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:29:53,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:29:53,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:29:53,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:29:53,053 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:29:53,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:29:53,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:29:53,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:29:53,061 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:29:53,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:29:53,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:29:53,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:29:53,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:29:53,065 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:29:53,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:29:53,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:29:53,069 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:29:53,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:29:53,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:29:53,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:29:53,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:29:53,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:29:53,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:29:53,071 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:29:53,071 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:29:53,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:29:53,072 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:29:53,072 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:29:53,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:29:53,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:29:53,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:29:53,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:29:53,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:29:53,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:29:53,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:29:53,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:29:53,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:29:53,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:29:53,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:29:53,075 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:29:53,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:29:53,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:29:53,075 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 -> 245f8deca690daafc67ff44dd7680fe4934c4e890117db34905ca3a31fc7577b [2024-06-27 17:29:53,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:29:53,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:29:53,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:29:53,322 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:29:53,322 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:29:53,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe025_rmo.i [2024-06-27 17:29:54,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:29:54,515 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:29:54,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_rmo.i [2024-06-27 17:29:54,530 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17766271d/3e16c26acd14470584a51ea1ef3b38c9/FLAGf43066f94 [2024-06-27 17:29:54,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17766271d/3e16c26acd14470584a51ea1ef3b38c9 [2024-06-27 17:29:54,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:29:54,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:29:54,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:29:54,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:29:54,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:29:54,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:29:54" (1/1) ... [2024-06-27 17:29:54,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c0b85b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:54, skipping insertion in model container [2024-06-27 17:29:54,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:29:54" (1/1) ... [2024-06-27 17:29:54,584 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:29:54,713 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_rmo.i[988,1001] [2024-06-27 17:29:54,902 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:29:54,918 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:29:54,929 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_rmo.i[988,1001] [2024-06-27 17:29:54,978 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:29:55,020 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:29:55,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:55 WrapperNode [2024-06-27 17:29:55,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:29:55,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:29:55,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:29:55,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:29:55,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:55" (1/1) ... [2024-06-27 17:29:55,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:55" (1/1) ... [2024-06-27 17:29:55,091 INFO L138 Inliner]: procedures = 175, calls = 72, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 160 [2024-06-27 17:29:55,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:29:55,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:29:55,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:29:55,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:29:55,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:55" (1/1) ... [2024-06-27 17:29:55,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:55" (1/1) ... [2024-06-27 17:29:55,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:55" (1/1) ... [2024-06-27 17:29:55,131 INFO L175 MemorySlicer]: Split 30 memory accesses to 2 slices as follows [2, 28]. 93 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 11 writes are split as follows [0, 11]. [2024-06-27 17:29:55,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:55" (1/1) ... [2024-06-27 17:29:55,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:55" (1/1) ... [2024-06-27 17:29:55,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:55" (1/1) ... [2024-06-27 17:29:55,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:55" (1/1) ... [2024-06-27 17:29:55,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:55" (1/1) ... [2024-06-27 17:29:55,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:55" (1/1) ... [2024-06-27 17:29:55,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:29:55,152 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:29:55,152 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:29:55,152 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:29:55,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:55" (1/1) ... [2024-06-27 17:29:55,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:29:55,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:29:55,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 17:29:55,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 17:29:55,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:29:55,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:29:55,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:29:55,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:29:55,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:29:55,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:29:55,217 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 17:29:55,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 17:29:55,217 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 17:29:55,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 17:29:55,217 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 17:29:55,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 17:29:55,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:29:55,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:29:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:29:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:29:55,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:29:55,219 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:29:55,354 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:29:55,355 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:29:55,701 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:29:55,701 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:29:55,968 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:29:55,968 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 17:29:55,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:29:55 BoogieIcfgContainer [2024-06-27 17:29:55,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:29:55,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:29:55,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:29:55,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:29:55,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:29:54" (1/3) ... [2024-06-27 17:29:55,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59771906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:29:55, skipping insertion in model container [2024-06-27 17:29:55,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:29:55" (2/3) ... [2024-06-27 17:29:55,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59771906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:29:55, skipping insertion in model container [2024-06-27 17:29:55,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:29:55" (3/3) ... [2024-06-27 17:29:55,979 INFO L112 eAbstractionObserver]: Analyzing ICFG safe025_rmo.i [2024-06-27 17:29:55,986 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:29:55,993 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:29:55,993 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:29:55,993 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:29:56,041 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 17:29:56,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-06-27 17:29:56,113 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-06-27 17:29:56,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:29:56,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-06-27 17:29:56,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-06-27 17:29:56,121 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-27 17:29:56,133 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:29:56,139 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@56f83fd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:29:56,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 17:29:56,153 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:29:56,153 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2024-06-27 17:29:56,154 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:29:56,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:56,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:56,155 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:29:56,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:56,159 INFO L85 PathProgramCache]: Analyzing trace with hash 650475479, now seen corresponding path program 1 times [2024-06-27 17:29:56,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:56,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410894050] [2024-06-27 17:29:56,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:56,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:56,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:56,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410894050] [2024-06-27 17:29:56,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410894050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:56,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:56,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:29:56,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134058301] [2024-06-27 17:29:56,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:56,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:29:56,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:56,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:29:56,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:29:56,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-06-27 17:29:56,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:29:56,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:56,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-06-27 17:29:56,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:57,293 INFO L124 PetriNetUnfolderBase]: 1795/2898 cut-off events. [2024-06-27 17:29:57,293 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-27 17:29:57,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5653 conditions, 2898 events. 1795/2898 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 17184 event pairs, 231 based on Foata normal form. 120/3006 useless extension candidates. Maximal degree in co-relation 5642. Up to 1551 conditions per place. [2024-06-27 17:29:57,308 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 45 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2024-06-27 17:29:57,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 237 flow [2024-06-27 17:29:57,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:29:57,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:29:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-06-27 17:29:57,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6730769230769231 [2024-06-27 17:29:57,318 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 4 states and 105 transitions. [2024-06-27 17:29:57,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 237 flow [2024-06-27 17:29:57,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 232 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:29:57,323 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2024-06-27 17:29:57,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-06-27 17:29:57,326 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2024-06-27 17:29:57,327 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2024-06-27 17:29:57,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:29:57,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:57,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:57,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:29:57,327 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:29:57,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:57,328 INFO L85 PathProgramCache]: Analyzing trace with hash -445086608, now seen corresponding path program 1 times [2024-06-27 17:29:57,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:57,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546626942] [2024-06-27 17:29:57,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:57,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:57,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:57,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546626942] [2024-06-27 17:29:57,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546626942] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:57,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:57,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:29:57,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414684956] [2024-06-27 17:29:57,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:57,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:29:57,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:57,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:29:57,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:29:57,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-06-27 17:29:57,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:29:57,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:57,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-06-27 17:29:57,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:57,888 INFO L124 PetriNetUnfolderBase]: 1125/1840 cut-off events. [2024-06-27 17:29:57,889 INFO L125 PetriNetUnfolderBase]: For 458/458 co-relation queries the response was YES. [2024-06-27 17:29:57,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4266 conditions, 1840 events. 1125/1840 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9663 event pairs, 129 based on Foata normal form. 96/1924 useless extension candidates. Maximal degree in co-relation 4254. Up to 641 conditions per place. [2024-06-27 17:29:57,897 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 57 selfloop transitions, 8 changer transitions 1/75 dead transitions. [2024-06-27 17:29:57,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 337 flow [2024-06-27 17:29:57,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:29:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:29:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2024-06-27 17:29:57,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6820512820512821 [2024-06-27 17:29:57,899 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 106 flow. Second operand 5 states and 133 transitions. [2024-06-27 17:29:57,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 337 flow [2024-06-27 17:29:57,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 75 transitions, 327 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 17:29:57,902 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 146 flow [2024-06-27 17:29:57,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-06-27 17:29:57,903 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2024-06-27 17:29:57,903 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 146 flow [2024-06-27 17:29:57,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:29:57,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:57,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:57,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:29:57,904 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:29:57,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:57,905 INFO L85 PathProgramCache]: Analyzing trace with hash 427993619, now seen corresponding path program 1 times [2024-06-27 17:29:57,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:57,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561328950] [2024-06-27 17:29:57,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:57,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:58,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:58,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561328950] [2024-06-27 17:29:58,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561328950] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:58,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:58,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:29:58,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413633310] [2024-06-27 17:29:58,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:58,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:29:58,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:58,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:29:58,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:29:58,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-06-27 17:29:58,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:29:58,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:58,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-06-27 17:29:58,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:58,365 INFO L124 PetriNetUnfolderBase]: 671/1082 cut-off events. [2024-06-27 17:29:58,366 INFO L125 PetriNetUnfolderBase]: For 856/856 co-relation queries the response was YES. [2024-06-27 17:29:58,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2822 conditions, 1082 events. 671/1082 cut-off events. For 856/856 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4906 event pairs, 109 based on Foata normal form. 44/1114 useless extension candidates. Maximal degree in co-relation 2808. Up to 364 conditions per place. [2024-06-27 17:29:58,371 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 49 selfloop transitions, 11 changer transitions 1/70 dead transitions. [2024-06-27 17:29:58,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 70 transitions, 340 flow [2024-06-27 17:29:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:29:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:29:58,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-06-27 17:29:58,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2024-06-27 17:29:58,373 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 146 flow. Second operand 6 states and 141 transitions. [2024-06-27 17:29:58,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 70 transitions, 340 flow [2024-06-27 17:29:58,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 315 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 17:29:58,377 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 160 flow [2024-06-27 17:29:58,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-06-27 17:29:58,378 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2024-06-27 17:29:58,378 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 160 flow [2024-06-27 17:29:58,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:29:58,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:58,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:58,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:29:58,379 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:29:58,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:58,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1189831510, now seen corresponding path program 1 times [2024-06-27 17:29:58,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:58,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397505051] [2024-06-27 17:29:58,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:58,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:58,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:58,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397505051] [2024-06-27 17:29:58,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397505051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:58,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:58,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:29:58,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328872648] [2024-06-27 17:29:58,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:58,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:29:58,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:58,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:29:58,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:29:58,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-06-27 17:29:58,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:29:58,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:58,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-06-27 17:29:58,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:29:58,979 INFO L124 PetriNetUnfolderBase]: 826/1563 cut-off events. [2024-06-27 17:29:58,979 INFO L125 PetriNetUnfolderBase]: For 692/706 co-relation queries the response was YES. [2024-06-27 17:29:58,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3545 conditions, 1563 events. 826/1563 cut-off events. For 692/706 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9058 event pairs, 159 based on Foata normal form. 8/1524 useless extension candidates. Maximal degree in co-relation 3530. Up to 699 conditions per place. [2024-06-27 17:29:58,985 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 29 selfloop transitions, 1 changer transitions 25/71 dead transitions. [2024-06-27 17:29:58,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 346 flow [2024-06-27 17:29:58,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:29:58,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:29:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2024-06-27 17:29:58,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5982905982905983 [2024-06-27 17:29:58,987 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 160 flow. Second operand 6 states and 140 transitions. [2024-06-27 17:29:58,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 346 flow [2024-06-27 17:29:58,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 282 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-27 17:29:58,992 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 115 flow [2024-06-27 17:29:58,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2024-06-27 17:29:58,992 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2024-06-27 17:29:58,992 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 115 flow [2024-06-27 17:29:58,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:29:58,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:29:58,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:29:58,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:29:58,993 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:29:58,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:29:58,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1548691214, now seen corresponding path program 2 times [2024-06-27 17:29:58,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:29:58,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044392823] [2024-06-27 17:29:58,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:29:58,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:29:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:29:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:29:59,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:29:59,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044392823] [2024-06-27 17:29:59,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044392823] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:29:59,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:29:59,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:29:59,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001640801] [2024-06-27 17:29:59,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:29:59,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:29:59,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:29:59,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:29:59,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:29:59,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-06-27 17:29:59,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 115 flow. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:29:59,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:29:59,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-06-27 17:29:59,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:00,275 INFO L124 PetriNetUnfolderBase]: 643/1242 cut-off events. [2024-06-27 17:30:00,275 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-06-27 17:30:00,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2520 conditions, 1242 events. 643/1242 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7107 event pairs, 249 based on Foata normal form. 8/1169 useless extension candidates. Maximal degree in co-relation 2506. Up to 628 conditions per place. [2024-06-27 17:30:00,280 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 25 selfloop transitions, 7 changer transitions 11/61 dead transitions. [2024-06-27 17:30:00,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 251 flow [2024-06-27 17:30:00,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:30:00,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:30:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2024-06-27 17:30:00,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5982905982905983 [2024-06-27 17:30:00,281 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 115 flow. Second operand 6 states and 140 transitions. [2024-06-27 17:30:00,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 251 flow [2024-06-27 17:30:00,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 240 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 17:30:00,283 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 155 flow [2024-06-27 17:30:00,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=155, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2024-06-27 17:30:00,284 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2024-06-27 17:30:00,284 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 155 flow [2024-06-27 17:30:00,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:30:00,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:00,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:00,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:30:00,291 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:30:00,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:00,292 INFO L85 PathProgramCache]: Analyzing trace with hash 781209670, now seen corresponding path program 3 times [2024-06-27 17:30:00,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:00,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870291759] [2024-06-27 17:30:00,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:00,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:30:00,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 17:30:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:30:00,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 17:30:00,428 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 17:30:00,429 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-06-27 17:30:00,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-06-27 17:30:00,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-27 17:30:00,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-27 17:30:00,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:30:00,432 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-06-27 17:30:00,435 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:30:00,436 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:30:00,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:30:00 BasicIcfg [2024-06-27 17:30:00,528 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:30:00,529 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 17:30:00,529 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 17:30:00,530 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 17:30:00,530 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:29:55" (3/4) ... [2024-06-27 17:30:00,531 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-06-27 17:30:00,641 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 17:30:00,641 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 17:30:00,642 INFO L158 Benchmark]: Toolchain (without parser) took 6098.68ms. Allocated memory was 113.2MB in the beginning and 400.6MB in the end (delta: 287.3MB). Free memory was 80.9MB in the beginning and 240.3MB in the end (delta: -159.4MB). Peak memory consumption was 126.9MB. Max. memory is 16.1GB. [2024-06-27 17:30:00,642 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 92.3MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:30:00,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.38ms. Allocated memory is still 113.2MB. Free memory was 80.4MB in the beginning and 53.6MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-06-27 17:30:00,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.12ms. Allocated memory is still 113.2MB. Free memory was 53.6MB in the beginning and 50.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:30:00,642 INFO L158 Benchmark]: Boogie Preprocessor took 59.65ms. Allocated memory is still 113.2MB. Free memory was 50.5MB in the beginning and 46.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:30:00,643 INFO L158 Benchmark]: RCFGBuilder took 817.36ms. Allocated memory was 113.2MB in the beginning and 146.8MB in the end (delta: 33.6MB). Free memory was 46.3MB in the beginning and 65.1MB in the end (delta: -18.8MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-06-27 17:30:00,643 INFO L158 Benchmark]: TraceAbstraction took 4556.56ms. Allocated memory was 146.8MB in the beginning and 400.6MB in the end (delta: 253.8MB). Free memory was 64.1MB in the beginning and 260.2MB in the end (delta: -196.1MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2024-06-27 17:30:00,643 INFO L158 Benchmark]: Witness Printer took 111.91ms. Allocated memory is still 400.6MB. Free memory was 260.2MB in the beginning and 240.3MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-06-27 17:30:00,645 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 92.3MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.38ms. Allocated memory is still 113.2MB. Free memory was 80.4MB in the beginning and 53.6MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.12ms. Allocated memory is still 113.2MB. Free memory was 53.6MB in the beginning and 50.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.65ms. Allocated memory is still 113.2MB. Free memory was 50.5MB in the beginning and 46.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 817.36ms. Allocated memory was 113.2MB in the beginning and 146.8MB in the end (delta: 33.6MB). Free memory was 46.3MB in the beginning and 65.1MB in the end (delta: -18.8MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4556.56ms. Allocated memory was 146.8MB in the beginning and 400.6MB in the end (delta: 253.8MB). Free memory was 64.1MB in the beginning and 260.2MB in the end (delta: -196.1MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. * Witness Printer took 111.91ms. Allocated memory is still 400.6MB. Free memory was 260.2MB in the beginning and 240.3MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2381; [L855] FCALL, FORK 0 pthread_create(&t2381, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2381=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] 0 pthread_t t2382; [L857] FCALL, FORK 0 pthread_create(&t2382, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2381=-1, t2382=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L858] 0 pthread_t t2383; [L859] FCALL, FORK 0 pthread_create(&t2383, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2381=-1, t2382=0, t2383=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 x$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(x) [L814] 3 x$mem_tmp = x [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] EXPR 3 \read(x) [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L816] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L817] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L818] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L819] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L821] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L823] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L824] EXPR 3 \read(x) [L824] 3 __unbuffered_p2_EAX = x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] 3 x = x$flush_delayed ? x$mem_tmp : x [L826] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L829] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] EXPR 1 \read(x) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L791] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L794] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 \read(x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 \read(x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L833] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L834] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L835] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L836] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2381=-1, t2382=0, t2383=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L865] EXPR 0 \read(x) [L865] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L866] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L867] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L868] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L869] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2381=-1, t2382=0, t2383=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 x$flush_delayed = weak$$choice2 [L875] EXPR 0 \read(x) [L875] 0 x$mem_tmp = x [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] EXPR 0 \read(x) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L877] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L878] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L879] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L880] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L882] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L884] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L884] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L884] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L885] EXPR 0 \read(x) [L885] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L886] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L886] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L886] 0 x = x$flush_delayed ? x$mem_tmp : x [L887] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2381=-1, t2382=0, t2383=1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L889] 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(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: 857]: 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: 859]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 285 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 266 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 574 IncrementalHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 13 mSDtfsCounter, 574 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=3, InterpolantAutomatonStates: 27, 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.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 758 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 17:30:00,676 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