./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.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 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:54:24,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:54:24,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:54:24,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:54:24,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:54:24,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:54:24,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:54:24,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:54:24,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:54:24,174 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:54:24,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:54:24,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:54:24,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:54:24,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:54:24,176 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:54:24,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:54:24,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:54:24,176 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:54:24,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:54:24,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:54:24,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:54:24,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:54:24,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:54:24,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:54:24,181 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:54:24,181 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:54:24,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:54:24,181 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:54:24,181 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:54:24,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:54:24,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:54:24,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:54:24,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:54:24,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:54:24,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:54:24,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:54:24,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:54:24,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:54:24,185 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:54:24,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:54:24,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:54:24,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:54:24,186 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 -> 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc [2024-10-13 06:54:24,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:54:24,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:54:24,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:54:24,415 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:54:24,415 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:54:24,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2024-10-13 06:54:25,694 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:54:25,884 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:54:25,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2024-10-13 06:54:25,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85ab32982/45723c1396b7471caae4b079641abe67/FLAG7cb33740e [2024-10-13 06:54:26,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85ab32982/45723c1396b7471caae4b079641abe67 [2024-10-13 06:54:26,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:54:26,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:54:26,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:54:26,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:54:26,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:54:26,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:54:26" (1/1) ... [2024-10-13 06:54:26,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d4a481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:54:26, skipping insertion in model container [2024-10-13 06:54:26,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:54:26" (1/1) ... [2024-10-13 06:54:26,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:54:26,434 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-10-13 06:54:26,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:54:26,618 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:54:26,628 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-10-13 06:54:26,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:54:26,718 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:54:26,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:54:26 WrapperNode [2024-10-13 06:54:26,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:54:26,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:54:26,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:54:26,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:54:26,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:54:26" (1/1) ... [2024-10-13 06:54:26,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:54:26" (1/1) ... [2024-10-13 06:54:26,770 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-10-13 06:54:26,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:54:26,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:54:26,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:54:26,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:54:26,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:54:26" (1/1) ... [2024-10-13 06:54:26,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:54:26" (1/1) ... [2024-10-13 06:54:26,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:54:26" (1/1) ... [2024-10-13 06:54:26,812 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 06:54:26,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:54:26" (1/1) ... [2024-10-13 06:54:26,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:54:26" (1/1) ... [2024-10-13 06:54:26,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:54:26" (1/1) ... [2024-10-13 06:54:26,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:54:26" (1/1) ... [2024-10-13 06:54:26,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:54:26" (1/1) ... [2024-10-13 06:54:26,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:54:26" (1/1) ... [2024-10-13 06:54:26,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:54:26,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:54:26,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:54:26,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:54:26,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:54:26" (1/1) ... [2024-10-13 06:54:26,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:54:26,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:54:26,863 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-10-13 06:54:26,865 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-10-13 06:54:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 06:54:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:54:26,903 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-13 06:54:26,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-13 06:54:26,903 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-13 06:54:26,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-13 06:54:26,903 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-13 06:54:26,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-13 06:54:26,904 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-13 06:54:26,905 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-13 06:54:26,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:54:26,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 06:54:26,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:54:26,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:54:26,906 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 06:54:27,019 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:54:27,020 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:54:27,262 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 06:54:27,263 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:54:27,423 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:54:27,423 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 06:54:27,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:54:27 BoogieIcfgContainer [2024-10-13 06:54:27,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:54:27,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:54:27,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:54:27,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:54:27,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:54:26" (1/3) ... [2024-10-13 06:54:27,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d4da5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:54:27, skipping insertion in model container [2024-10-13 06:54:27,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:54:26" (2/3) ... [2024-10-13 06:54:27,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d4da5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:54:27, skipping insertion in model container [2024-10-13 06:54:27,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:54:27" (3/3) ... [2024-10-13 06:54:27,432 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_power.oepc_pso.oepc_rmo.oepc.i [2024-10-13 06:54:27,446 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:54:27,447 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 06:54:27,447 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 06:54:27,502 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 06:54:27,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2024-10-13 06:54:27,584 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-10-13 06:54:27,584 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 06:54:27,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-10-13 06:54:27,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2024-10-13 06:54:27,591 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2024-10-13 06:54:27,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:54:27,608 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@135301, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:54:27,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-13 06:54:27,612 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 06:54:27,612 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-13 06:54:27,612 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 06:54:27,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:54:27,613 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-13 06:54:27,613 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 06:54:27,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:54:27,618 INFO L85 PathProgramCache]: Analyzing trace with hash 11930355, now seen corresponding path program 1 times [2024-10-13 06:54:27,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:54:27,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446897168] [2024-10-13 06:54:27,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:54:27,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:54:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:54:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 06:54:27,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:54:27,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446897168] [2024-10-13 06:54:27,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446897168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:54:27,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:54:27,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 06:54:28,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014795969] [2024-10-13 06:54:28,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:54:28,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:54:28,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:54:28,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:54:28,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:54:28,025 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 49 [2024-10-13 06:54:28,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:28,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:54:28,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 49 [2024-10-13 06:54:28,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:54:28,640 INFO L124 PetriNetUnfolderBase]: 2495/4136 cut-off events. [2024-10-13 06:54:28,640 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-10-13 06:54:28,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7712 conditions, 4136 events. 2495/4136 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 28519 event pairs, 443 based on Foata normal form. 135/4200 useless extension candidates. Maximal degree in co-relation 7700. Up to 2779 conditions per place. [2024-10-13 06:54:28,664 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 37 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2024-10-13 06:54:28,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 225 flow [2024-10-13 06:54:28,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:54:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 06:54:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-10-13 06:54:28,673 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7891156462585034 [2024-10-13 06:54:28,675 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 116 transitions. [2024-10-13 06:54:28,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 225 flow [2024-10-13 06:54:28,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 218 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 06:54:28,681 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2024-10-13 06:54:28,684 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-10-13 06:54:28,686 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-10-13 06:54:28,687 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2024-10-13 06:54:28,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:28,688 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:54:28,688 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:54:28,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:54:28,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 06:54:28,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:54:28,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1457321110, now seen corresponding path program 1 times [2024-10-13 06:54:28,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:54:28,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091915773] [2024-10-13 06:54:28,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:54:28,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:54:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:54:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 06:54:28,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:54:28,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091915773] [2024-10-13 06:54:28,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091915773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:54:28,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:54:28,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:54:28,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308418715] [2024-10-13 06:54:28,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:54:28,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:54:28,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:54:28,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:54:28,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:54:28,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-10-13 06:54:28,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:28,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:54:28,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-10-13 06:54:28,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:54:30,026 INFO L124 PetriNetUnfolderBase]: 7779/12167 cut-off events. [2024-10-13 06:54:30,027 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2024-10-13 06:54:30,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23583 conditions, 12167 events. 7779/12167 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 86792 event pairs, 1033 based on Foata normal form. 400/12068 useless extension candidates. Maximal degree in co-relation 23573. Up to 5841 conditions per place. [2024-10-13 06:54:30,082 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 52 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2024-10-13 06:54:30,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 288 flow [2024-10-13 06:54:30,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:54:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 06:54:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2024-10-13 06:54:30,084 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6989795918367347 [2024-10-13 06:54:30,084 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 4 states and 137 transitions. [2024-10-13 06:54:30,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 288 flow [2024-10-13 06:54:30,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 06:54:30,090 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 134 flow [2024-10-13 06:54:30,090 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-10-13 06:54:30,091 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-10-13 06:54:30,091 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 134 flow [2024-10-13 06:54:30,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:30,091 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:54:30,091 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:54:30,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:54:30,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 06:54:30,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:54:30,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1264106216, now seen corresponding path program 1 times [2024-10-13 06:54:30,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:54:30,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517971917] [2024-10-13 06:54:30,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:54:30,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:54:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:54:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 06:54:30,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:54:30,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517971917] [2024-10-13 06:54:30,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517971917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:54:30,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:54:30,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:54:30,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626979836] [2024-10-13 06:54:30,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:54:30,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:54:30,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:54:30,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:54:30,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:54:30,380 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-10-13 06:54:30,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:30,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:54:30,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-10-13 06:54:30,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:54:31,316 INFO L124 PetriNetUnfolderBase]: 6075/9467 cut-off events. [2024-10-13 06:54:31,316 INFO L125 PetriNetUnfolderBase]: For 2276/2276 co-relation queries the response was YES. [2024-10-13 06:54:31,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21251 conditions, 9467 events. 6075/9467 cut-off events. For 2276/2276 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 63571 event pairs, 451 based on Foata normal form. 364/9470 useless extension candidates. Maximal degree in co-relation 21239. Up to 3681 conditions per place. [2024-10-13 06:54:31,358 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 67 selfloop transitions, 10 changer transitions 1/93 dead transitions. [2024-10-13 06:54:31,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 93 transitions, 413 flow [2024-10-13 06:54:31,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:54:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 06:54:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2024-10-13 06:54:31,364 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2024-10-13 06:54:31,364 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 134 flow. Second operand 5 states and 175 transitions. [2024-10-13 06:54:31,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 93 transitions, 413 flow [2024-10-13 06:54:31,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 402 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-13 06:54:31,369 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 186 flow [2024-10-13 06:54:31,369 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-10-13 06:54:31,370 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2024-10-13 06:54:31,370 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 186 flow [2024-10-13 06:54:31,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:31,370 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:54:31,370 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:54:31,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:54:31,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 06:54:31,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:54:31,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1510528105, now seen corresponding path program 1 times [2024-10-13 06:54:31,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:54:31,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290537744] [2024-10-13 06:54:31,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:54:31,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:54:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:54:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 06:54:31,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:54:31,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290537744] [2024-10-13 06:54:31,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290537744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:54:31,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:54:31,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:54:31,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184040992] [2024-10-13 06:54:31,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:54:31,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:54:31,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:54:31,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:54:31,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:54:31,593 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-10-13 06:54:31,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:31,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:54:31,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-10-13 06:54:31,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:54:32,154 INFO L124 PetriNetUnfolderBase]: 4027/6115 cut-off events. [2024-10-13 06:54:32,155 INFO L125 PetriNetUnfolderBase]: For 4654/4654 co-relation queries the response was YES. [2024-10-13 06:54:32,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15565 conditions, 6115 events. 4027/6115 cut-off events. For 4654/4654 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 35758 event pairs, 289 based on Foata normal form. 244/6151 useless extension candidates. Maximal degree in co-relation 15551. Up to 1788 conditions per place. [2024-10-13 06:54:32,178 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 80 selfloop transitions, 14 changer transitions 1/110 dead transitions. [2024-10-13 06:54:32,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 110 transitions, 544 flow [2024-10-13 06:54:32,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:54:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 06:54:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2024-10-13 06:54:32,180 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.717687074829932 [2024-10-13 06:54:32,180 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 186 flow. Second operand 6 states and 211 transitions. [2024-10-13 06:54:32,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 110 transitions, 544 flow [2024-10-13 06:54:32,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 110 transitions, 514 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-13 06:54:32,194 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 236 flow [2024-10-13 06:54:32,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2024-10-13 06:54:32,194 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2024-10-13 06:54:32,195 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 236 flow [2024-10-13 06:54:32,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:32,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:54:32,195 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:54:32,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:54:32,195 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 06:54:32,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:54:32,196 INFO L85 PathProgramCache]: Analyzing trace with hash 157947390, now seen corresponding path program 1 times [2024-10-13 06:54:32,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:54:32,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636209922] [2024-10-13 06:54:32,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:54:32,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:54:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:54:32,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 06:54:32,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:54:32,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636209922] [2024-10-13 06:54:32,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636209922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:54:32,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:54:32,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:54:32,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945780130] [2024-10-13 06:54:32,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:54:32,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:54:32,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:54:32,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:54:32,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:54:32,444 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-10-13 06:54:32,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:32,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:54:32,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-10-13 06:54:32,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:54:32,962 INFO L124 PetriNetUnfolderBase]: 2863/4163 cut-off events. [2024-10-13 06:54:32,962 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES. [2024-10-13 06:54:32,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11590 conditions, 4163 events. 2863/4163 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21805 event pairs, 231 based on Foata normal form. 96/4131 useless extension candidates. Maximal degree in co-relation 11575. Up to 1316 conditions per place. [2024-10-13 06:54:32,982 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 71 selfloop transitions, 18 changer transitions 1/105 dead transitions. [2024-10-13 06:54:32,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 105 transitions, 534 flow [2024-10-13 06:54:32,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:54:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 06:54:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2024-10-13 06:54:32,984 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6559766763848397 [2024-10-13 06:54:32,984 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 236 flow. Second operand 7 states and 225 transitions. [2024-10-13 06:54:32,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 105 transitions, 534 flow [2024-10-13 06:54:33,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 105 transitions, 488 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-13 06:54:33,010 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 246 flow [2024-10-13 06:54:33,010 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-10-13 06:54:33,011 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2024-10-13 06:54:33,011 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 246 flow [2024-10-13 06:54:33,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:33,012 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:54:33,012 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:54:33,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:54:33,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 06:54:33,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:54:33,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1391379549, now seen corresponding path program 1 times [2024-10-13 06:54:33,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:54:33,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224420097] [2024-10-13 06:54:33,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:54:33,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:54:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:54:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 06:54:34,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:54:34,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224420097] [2024-10-13 06:54:34,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224420097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:54:34,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:54:34,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:54:34,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167442204] [2024-10-13 06:54:34,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:54:34,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:54:34,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:54:34,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:54:34,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:54:34,634 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-10-13 06:54:34,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 246 flow. Second operand has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:34,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:54:34,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-10-13 06:54:34,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:54:36,259 INFO L124 PetriNetUnfolderBase]: 13381/20137 cut-off events. [2024-10-13 06:54:36,260 INFO L125 PetriNetUnfolderBase]: For 7917/8283 co-relation queries the response was YES. [2024-10-13 06:54:36,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46734 conditions, 20137 events. 13381/20137 cut-off events. For 7917/8283 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 136631 event pairs, 945 based on Foata normal form. 16/19523 useless extension candidates. Maximal degree in co-relation 46718. Up to 3448 conditions per place. [2024-10-13 06:54:36,365 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 117 selfloop transitions, 35 changer transitions 14/190 dead transitions. [2024-10-13 06:54:36,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 190 transitions, 904 flow [2024-10-13 06:54:36,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:54:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 06:54:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 343 transitions. [2024-10-13 06:54:36,367 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-10-13 06:54:36,367 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 246 flow. Second operand 11 states and 343 transitions. [2024-10-13 06:54:36,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 190 transitions, 904 flow [2024-10-13 06:54:36,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 190 transitions, 778 flow, removed 32 selfloop flow, removed 10 redundant places. [2024-10-13 06:54:36,604 INFO L231 Difference]: Finished difference. Result has 75 places, 90 transitions, 421 flow [2024-10-13 06:54:36,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=421, PETRI_PLACES=75, PETRI_TRANSITIONS=90} [2024-10-13 06:54:36,605 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 18 predicate places. [2024-10-13 06:54:36,605 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 90 transitions, 421 flow [2024-10-13 06:54:36,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:36,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:54:36,605 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:54:36,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:54:36,606 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 06:54:36,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:54:36,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1661637211, now seen corresponding path program 2 times [2024-10-13 06:54:36,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:54:36,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112485959] [2024-10-13 06:54:36,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:54:36,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:54:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:54:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 06:54:36,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:54:36,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112485959] [2024-10-13 06:54:36,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112485959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:54:36,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:54:36,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:54:36,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485272187] [2024-10-13 06:54:36,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:54:36,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:54:36,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:54:36,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:54:36,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:54:36,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-10-13 06:54:36,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 90 transitions, 421 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:36,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:54:36,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-10-13 06:54:36,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:54:39,074 INFO L124 PetriNetUnfolderBase]: 20147/30667 cut-off events. [2024-10-13 06:54:39,075 INFO L125 PetriNetUnfolderBase]: For 30312/30355 co-relation queries the response was YES. [2024-10-13 06:54:39,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85599 conditions, 30667 events. 20147/30667 cut-off events. For 30312/30355 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 227533 event pairs, 4473 based on Foata normal form. 26/29264 useless extension candidates. Maximal degree in co-relation 85579. Up to 11170 conditions per place. [2024-10-13 06:54:39,252 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 88 selfloop transitions, 33 changer transitions 24/169 dead transitions. [2024-10-13 06:54:39,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 169 transitions, 1068 flow [2024-10-13 06:54:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:54:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 06:54:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2024-10-13 06:54:39,254 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6156462585034014 [2024-10-13 06:54:39,255 INFO L175 Difference]: Start difference. First operand has 75 places, 90 transitions, 421 flow. Second operand 6 states and 181 transitions. [2024-10-13 06:54:39,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 169 transitions, 1068 flow [2024-10-13 06:54:39,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 169 transitions, 1062 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-13 06:54:39,441 INFO L231 Difference]: Finished difference. Result has 81 places, 109 transitions, 694 flow [2024-10-13 06:54:39,441 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=694, PETRI_PLACES=81, PETRI_TRANSITIONS=109} [2024-10-13 06:54:39,442 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2024-10-13 06:54:39,442 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 109 transitions, 694 flow [2024-10-13 06:54:39,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:39,442 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:54:39,442 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:54:39,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:54:39,443 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 06:54:39,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:54:39,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1956208359, now seen corresponding path program 3 times [2024-10-13 06:54:39,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:54:39,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900691572] [2024-10-13 06:54:39,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:54:39,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:54:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:54:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 06:54:39,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:54:39,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900691572] [2024-10-13 06:54:39,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900691572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:54:39,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:54:39,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:54:39,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515309445] [2024-10-13 06:54:39,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:54:39,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:54:39,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:54:39,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:54:39,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:54:39,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-10-13 06:54:39,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 109 transitions, 694 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:39,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:54:39,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-10-13 06:54:39,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:54:43,981 INFO L124 PetriNetUnfolderBase]: 27113/40849 cut-off events. [2024-10-13 06:54:43,982 INFO L125 PetriNetUnfolderBase]: For 61245/61248 co-relation queries the response was YES. [2024-10-13 06:54:44,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121462 conditions, 40849 events. 27113/40849 cut-off events. For 61245/61248 co-relation queries the response was YES. Maximal size of possible extension queue 2287. Compared 309548 event pairs, 3317 based on Foata normal form. 16/39007 useless extension candidates. Maximal degree in co-relation 121437. Up to 18491 conditions per place. [2024-10-13 06:54:44,216 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 75 selfloop transitions, 43 changer transitions 54/195 dead transitions. [2024-10-13 06:54:44,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 195 transitions, 1545 flow [2024-10-13 06:54:44,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:54:44,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 06:54:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2024-10-13 06:54:44,218 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5743440233236151 [2024-10-13 06:54:44,218 INFO L175 Difference]: Start difference. First operand has 81 places, 109 transitions, 694 flow. Second operand 7 states and 197 transitions. [2024-10-13 06:54:44,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 195 transitions, 1545 flow [2024-10-13 06:54:44,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 195 transitions, 1539 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-13 06:54:44,523 INFO L231 Difference]: Finished difference. Result has 88 places, 109 transitions, 887 flow [2024-10-13 06:54:44,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=887, PETRI_PLACES=88, PETRI_TRANSITIONS=109} [2024-10-13 06:54:44,524 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2024-10-13 06:54:44,524 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 109 transitions, 887 flow [2024-10-13 06:54:44,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:44,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:54:44,525 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:54:44,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:54:44,525 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 06:54:44,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:54:44,525 INFO L85 PathProgramCache]: Analyzing trace with hash 343727913, now seen corresponding path program 4 times [2024-10-13 06:54:44,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:54:44,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092632945] [2024-10-13 06:54:44,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:54:44,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:54:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:54:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 06:54:44,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:54:44,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092632945] [2024-10-13 06:54:44,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092632945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:54:44,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:54:44,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:54:44,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150135396] [2024-10-13 06:54:44,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:54:44,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:54:44,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:54:44,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:54:44,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:54:44,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-10-13 06:54:44,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 109 transitions, 887 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:44,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:54:44,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-10-13 06:54:44,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:54:45,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L761-->L764: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][98], [130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 60#true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 56#true, Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 54#L821true, 81#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 181#(= ~x~0 1), 7#L804true, 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 58#true, Black: 146#true, Black: 148#(= ~y~0 1), 14#L872true, 62#true, 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 36#L764true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 38#L791true, Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(= ~z~0 1)]) [2024-10-13 06:54:45,527 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-13 06:54:45,527 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-13 06:54:45,527 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-13 06:54:45,527 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-13 06:54:45,528 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L761-->L764: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][74], [60#true, 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 42#L801true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 56#true, Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 54#L821true, 81#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 181#(= ~x~0 1), 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 58#true, Black: 146#true, Black: 148#(= ~y~0 1), 14#L872true, 62#true, 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 36#L764true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 38#L791true, Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(= ~z~0 1)]) [2024-10-13 06:54:45,528 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-10-13 06:54:45,528 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-13 06:54:45,528 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-13 06:54:45,528 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-13 06:54:45,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][39], [60#true, 20#L761true, 56#true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 54#L821true, Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 81#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 58#true, Black: 148#(= ~y~0 1), Black: 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 26#L811true, 14#L872true, 62#true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 146#true, 38#L791true, Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(= ~z~0 1), 179#true]) [2024-10-13 06:54:45,642 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-13 06:54:45,643 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-13 06:54:45,643 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-13 06:54:45,643 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-13 06:54:45,839 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse3 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse5 (not .cse3)) (.cse13 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse4 (and .cse3 .cse8)) (.cse6 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse3))) (let ((.cse10 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse11 (or .cse13 .cse4 .cse6)) (.cse12 (and .cse5 (not .cse13)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse2 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse9 (ite .cse11 v_~a~0_74 (ite .cse12 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48))) (.cse0 (not .cse10))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (or (= |v_P3_#t~nondet4_25| 1) (= |v_P3_#t~nondet4_25| 0)) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_61 (ite (= (mod (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~a$r_buff0_thd4~0_62 (ite (and .cse5 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) 256) 0) 0 1)) (= v_~weak$$choice0~0_15 (ite (= (mod |v_P3_#t~nondet3_35| 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet4_25| 256) 0) 0 1) v_~weak$$choice2~0_30) (= (ite (= (mod (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse4 .cse6) v_~a$w_buff1_used~0_125 0)) 256) 0) 0 1) v_~a$w_buff1_used~0_124) (or (= |v_P3_#t~nondet3_35| 0) (= |v_P3_#t~nondet3_35| 1)) (= (ite (= (mod (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse2))) v_~a$r_buff1_thd4~0_60 0)) 256) 0) 0 1) v_~a$r_buff1_thd4~0_59) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse9 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite (not (= (mod (ite .cse10 0 1) 256) 0)) v_~a$mem_tmp~0_18 .cse9)) (= v_~a$w_buff0_used~0_137 (ite (= (mod (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse11 v_~a$w_buff0_used~0_138 (ite .cse12 0 v_~a$w_buff0_used~0_138))) 256) 0) 0 1))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_15, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_35|, |v_P3_#t~nondet4_25|] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][73], [60#true, 20#L761true, 33#L840true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 56#true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 81#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 7#L804true, 58#true, Black: 148#(= ~y~0 1), Black: 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 14#L872true, 62#true, 117#true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 146#true, 38#L791true, Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), 179#true, 163#(= ~z~0 1)]) [2024-10-13 06:54:45,839 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-10-13 06:54:45,839 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 06:54:45,839 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 06:54:45,839 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 06:54:45,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L761-->L764: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][98], [60#true, 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 30#P1EXITtrue, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 56#true, Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 54#L821true, Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 181#(= ~x~0 1), 7#L804true, 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 58#true, Black: 146#true, Black: 148#(= ~y~0 1), 14#L872true, 62#true, 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 36#L764true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(= ~z~0 1)]) [2024-10-13 06:54:45,914 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-10-13 06:54:45,914 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 06:54:45,914 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 06:54:45,914 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 06:54:45,914 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][39], [60#true, 30#P1EXITtrue, 20#L761true, 56#true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 54#L821true, Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 58#true, Black: 148#(= ~y~0 1), Black: 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 26#L811true, 14#L872true, 62#true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 146#true, Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(= ~z~0 1), 179#true]) [2024-10-13 06:54:45,914 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-10-13 06:54:45,914 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 06:54:45,914 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 06:54:45,914 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-13 06:54:45,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L761-->L764: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][74], [60#true, 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 30#P1EXITtrue, 42#L801true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 56#true, Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 54#L821true, Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 181#(= ~x~0 1), 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 58#true, Black: 146#true, Black: 148#(= ~y~0 1), 14#L872true, 62#true, 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 36#L764true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(= ~z~0 1)]) [2024-10-13 06:54:45,915 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-10-13 06:54:45,915 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 06:54:45,915 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 06:54:45,915 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 06:54:46,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L761-->L764: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][74], [130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 60#true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 47#L824true, 56#true, Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 81#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 181#(= ~x~0 1), 7#L804true, 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 58#true, Black: 146#true, Black: 148#(= ~y~0 1), 14#L872true, 62#true, 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 36#L764true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 38#L791true, Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(= ~z~0 1)]) [2024-10-13 06:54:46,183 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2024-10-13 06:54:46,183 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-10-13 06:54:46,183 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-10-13 06:54:46,183 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-10-13 06:54:46,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse3 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse5 (not .cse3)) (.cse13 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse4 (and .cse3 .cse8)) (.cse6 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse3))) (let ((.cse10 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse11 (or .cse13 .cse4 .cse6)) (.cse12 (and .cse5 (not .cse13)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse2 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse9 (ite .cse11 v_~a~0_74 (ite .cse12 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48))) (.cse0 (not .cse10))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (or (= |v_P3_#t~nondet4_25| 1) (= |v_P3_#t~nondet4_25| 0)) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_61 (ite (= (mod (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~a$r_buff0_thd4~0_62 (ite (and .cse5 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) 256) 0) 0 1)) (= v_~weak$$choice0~0_15 (ite (= (mod |v_P3_#t~nondet3_35| 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet4_25| 256) 0) 0 1) v_~weak$$choice2~0_30) (= (ite (= (mod (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse4 .cse6) v_~a$w_buff1_used~0_125 0)) 256) 0) 0 1) v_~a$w_buff1_used~0_124) (or (= |v_P3_#t~nondet3_35| 0) (= |v_P3_#t~nondet3_35| 1)) (= (ite (= (mod (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse2))) v_~a$r_buff1_thd4~0_60 0)) 256) 0) 0 1) v_~a$r_buff1_thd4~0_59) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse9 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite (not (= (mod (ite .cse10 0 1) 256) 0)) v_~a$mem_tmp~0_18 .cse9)) (= v_~a$w_buff0_used~0_137 (ite (= (mod (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse11 v_~a$w_buff0_used~0_138 (ite .cse12 0 v_~a$w_buff0_used~0_138))) 256) 0) 0 1))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_15, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_35|, |v_P3_#t~nondet4_25|] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][73], [60#true, 30#P1EXITtrue, 33#L840true, 20#L761true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 56#true, Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 7#L804true, 58#true, Black: 148#(= ~y~0 1), Black: 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 14#L872true, 62#true, 117#true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 146#true, Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), 179#true, 163#(= ~z~0 1)]) [2024-10-13 06:54:46,248 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-10-13 06:54:46,248 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-13 06:54:46,249 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-13 06:54:46,249 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-13 06:54:47,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L761-->L764: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][74], [130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 60#true, 30#P1EXITtrue, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 47#L824true, 56#true, Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 181#(= ~x~0 1), 7#L804true, 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 58#true, Black: 146#true, Black: 148#(= ~y~0 1), 14#L872true, 62#true, 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 36#L764true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(= ~z~0 1)]) [2024-10-13 06:54:47,013 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is not cut-off event [2024-10-13 06:54:47,013 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-10-13 06:54:47,013 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-10-13 06:54:47,013 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-10-13 06:54:49,414 INFO L124 PetriNetUnfolderBase]: 28346/45770 cut-off events. [2024-10-13 06:54:49,414 INFO L125 PetriNetUnfolderBase]: For 71551/73078 co-relation queries the response was YES. [2024-10-13 06:54:49,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130543 conditions, 45770 events. 28346/45770 cut-off events. For 71551/73078 co-relation queries the response was YES. Maximal size of possible extension queue 2974. Compared 404285 event pairs, 12343 based on Foata normal form. 341/42120 useless extension candidates. Maximal degree in co-relation 130513. Up to 18288 conditions per place. [2024-10-13 06:54:49,677 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 44 selfloop transitions, 7 changer transitions 53/148 dead transitions. [2024-10-13 06:54:49,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 148 transitions, 1266 flow [2024-10-13 06:54:49,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:54:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 06:54:49,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-10-13 06:54:49,678 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.636734693877551 [2024-10-13 06:54:49,678 INFO L175 Difference]: Start difference. First operand has 88 places, 109 transitions, 887 flow. Second operand 5 states and 156 transitions. [2024-10-13 06:54:49,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 148 transitions, 1266 flow [2024-10-13 06:54:50,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 148 transitions, 1260 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-13 06:54:50,111 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 611 flow [2024-10-13 06:54:50,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=611, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2024-10-13 06:54:50,112 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 34 predicate places. [2024-10-13 06:54:50,112 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 611 flow [2024-10-13 06:54:50,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:54:50,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:54:50,113 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:54:50,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:54:50,113 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 06:54:50,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:54:50,113 INFO L85 PathProgramCache]: Analyzing trace with hash 141002287, now seen corresponding path program 5 times [2024-10-13 06:54:50,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:54:50,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868565015] [2024-10-13 06:54:50,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:54:50,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:54:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:54:50,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:54:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:54:50,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:54:50,446 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:54:50,447 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-10-13 06:54:50,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-10-13 06:54:50,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-10-13 06:54:50,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-13 06:54:50,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-13 06:54:50,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-13 06:54:50,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-10-13 06:54:50,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:54:50,453 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-10-13 06:54:50,541 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 06:54:50,542 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:54:50,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:54:50 BasicIcfg [2024-10-13 06:54:50,550 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:54:50,551 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:54:50,551 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:54:50,551 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:54:50,551 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:54:27" (3/4) ... [2024-10-13 06:54:50,555 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-13 06:54:50,647 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 06:54:50,647 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:54:50,647 INFO L158 Benchmark]: Toolchain (without parser) took 24391.81ms. Allocated memory was 203.4MB in the beginning and 8.8GB in the end (delta: 8.6GB). Free memory was 133.9MB in the beginning and 7.8GB in the end (delta: -7.7GB). Peak memory consumption was 869.4MB. Max. memory is 16.1GB. [2024-10-13 06:54:50,648 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:54:50,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.98ms. Allocated memory is still 203.4MB. Free memory was 133.6MB in the beginning and 166.2MB in the end (delta: -32.6MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2024-10-13 06:54:50,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.14ms. Allocated memory is still 203.4MB. Free memory was 166.2MB in the beginning and 164.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 06:54:50,648 INFO L158 Benchmark]: Boogie Preprocessor took 63.73ms. Allocated memory is still 203.4MB. Free memory was 164.1MB in the beginning and 159.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:54:50,648 INFO L158 Benchmark]: RCFGBuilder took 589.10ms. Allocated memory is still 203.4MB. Free memory was 159.9MB in the beginning and 104.1MB in the end (delta: 55.8MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-10-13 06:54:50,649 INFO L158 Benchmark]: TraceAbstraction took 23124.21ms. Allocated memory was 203.4MB in the beginning and 8.8GB in the end (delta: 8.6GB). Free memory was 103.3MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-10-13 06:54:50,649 INFO L158 Benchmark]: Witness Printer took 96.41ms. Allocated memory is still 8.8GB. Free memory was 7.9GB in the beginning and 7.8GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 06:54:50,650 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.12ms. Allocated memory is still 109.1MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.98ms. Allocated memory is still 203.4MB. Free memory was 133.6MB in the beginning and 166.2MB in the end (delta: -32.6MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.14ms. Allocated memory is still 203.4MB. Free memory was 166.2MB in the beginning and 164.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.73ms. Allocated memory is still 203.4MB. Free memory was 164.1MB in the beginning and 159.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 589.10ms. Allocated memory is still 203.4MB. Free memory was 159.9MB in the beginning and 104.1MB in the end (delta: 55.8MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23124.21ms. Allocated memory was 203.4MB in the beginning and 8.8GB in the end (delta: 8.6GB). Free memory was 103.3MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 96.41ms. Allocated memory is still 8.8GB. Free memory was 7.9GB in the beginning and 7.8GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t553; [L865] FCALL, FORK 0 pthread_create(&t553, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t553=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t554; [L867] FCALL, FORK 0 pthread_create(&t554, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t553=-3, t554=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L868] 0 pthread_t t555; [L869] FCALL, FORK 0 pthread_create(&t555, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t553=-3, t554=-2, t555=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L800] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L870] 0 pthread_t t556; [L871] FCALL, FORK 0 pthread_create(&t556, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t553=-3, t554=-2, t555=-1, t556=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L820] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L823] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t553=-3, t554=-2, t555=-1, t556=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t553=-3, t554=-2, t555=-1, t556=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t553=-3, t554=-2, t555=-1, t556=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 871]: 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: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 83 locations, 7 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: 22.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 731 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 693 mSDsluCounter, 359 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 293 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1534 IncrementalHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 66 mSDtfsCounter, 1534 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=887occurred in iteration=8, InterpolantAutomatonStates: 54, 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.8s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 1548 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-10-13 06:54:50,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE