./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:12:36,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:12:36,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:12:36,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:12:36,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:12:36,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:12:36,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:12:36,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:12:36,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:12:36,176 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:12:36,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:12:36,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:12:36,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:12:36,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:12:36,178 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:12:36,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:12:36,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:12:36,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:12:36,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:12:36,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:12:36,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:12:36,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:12:36,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:12:36,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:12:36,181 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:12:36,182 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:12:36,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:12:36,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:12:36,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:12:36,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:12:36,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:12:36,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:12:36,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:12:36,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:12:36,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:12:36,185 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:12:36,185 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:12:36,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:12:36,185 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:12:36,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:12:36,186 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:12:36,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:12:36,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:12:36,187 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 -> bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315 [2024-01-27 16:12:36,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:12:36,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:12:36,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:12:36,443 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:12:36,443 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:12:36,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-01-27 16:12:37,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:12:37,706 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:12:37,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-01-27 16:12:37,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d67020b59/5c0c12c66ace415088f5cd09a2222d99/FLAG15cbbca4a [2024-01-27 16:12:37,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d67020b59/5c0c12c66ace415088f5cd09a2222d99 [2024-01-27 16:12:37,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:12:37,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:12:37,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:12:37,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:12:37,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:12:37,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:12:37" (1/1) ... [2024-01-27 16:12:37,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c287fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:12:37, skipping insertion in model container [2024-01-27 16:12:37,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:12:37" (1/1) ... [2024-01-27 16:12:37,814 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:12:37,950 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2024-01-27 16:12:38,069 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:12:38,082 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:12:38,094 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2024-01-27 16:12:38,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:12:38,176 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:12:38,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:12:38 WrapperNode [2024-01-27 16:12:38,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:12:38,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:12:38,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:12:38,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:12:38,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:12:38" (1/1) ... [2024-01-27 16:12:38,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:12:38" (1/1) ... [2024-01-27 16:12:38,222 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2024-01-27 16:12:38,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:12:38,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:12:38,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:12:38,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:12:38,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:12:38" (1/1) ... [2024-01-27 16:12:38,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:12:38" (1/1) ... [2024-01-27 16:12:38,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:12:38" (1/1) ... [2024-01-27 16:12:38,249 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-27 16:12:38,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:12:38" (1/1) ... [2024-01-27 16:12:38,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:12:38" (1/1) ... [2024-01-27 16:12:38,256 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:12:38" (1/1) ... [2024-01-27 16:12:38,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:12:38" (1/1) ... [2024-01-27 16:12:38,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:12:38" (1/1) ... [2024-01-27 16:12:38,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:12:38" (1/1) ... [2024-01-27 16:12:38,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:12:38,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:12:38,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:12:38,279 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:12:38,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:12:38" (1/1) ... [2024-01-27 16:12:38,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:12:38,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:12:38,343 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-01-27 16:12:38,368 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-01-27 16:12:38,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:12:38,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:12:38,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:12:38,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:12:38,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 16:12:38,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:12:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:12:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:12:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:12:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-27 16:12:38,390 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-27 16:12:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-27 16:12:38,390 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-27 16:12:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-27 16:12:38,390 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-27 16:12:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-01-27 16:12:38,390 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-01-27 16:12:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:12:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:12:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:12:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:12:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 16:12:38,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:12:38,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:12:38,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:12:38,393 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:12:38,538 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:12:38,539 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:12:38,839 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:12:38,840 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:12:38,971 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:12:38,971 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 16:12:38,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:12:38 BoogieIcfgContainer [2024-01-27 16:12:38,972 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:12:38,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:12:38,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:12:38,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:12:38,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:12:37" (1/3) ... [2024-01-27 16:12:38,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc1212a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:12:38, skipping insertion in model container [2024-01-27 16:12:38,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:12:38" (2/3) ... [2024-01-27 16:12:38,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc1212a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:12:38, skipping insertion in model container [2024-01-27 16:12:38,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:12:38" (3/3) ... [2024-01-27 16:12:38,978 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-01-27 16:12:38,984 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:12:38,991 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:12:38,992 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-01-27 16:12:38,992 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:12:39,037 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 16:12:39,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2024-01-27 16:12:39,106 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-01-27 16:12:39,107 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:12:39,115 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 87 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-01-27 16:12:39,116 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2024-01-27 16:12:39,119 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2024-01-27 16:12:39,126 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:12:39,131 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@77283e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:12:39,131 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-01-27 16:12:39,134 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:12:39,134 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-01-27 16:12:39,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:12:39,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:12:39,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 16:12:39,135 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:12:39,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:12:39,139 INFO L85 PathProgramCache]: Analyzing trace with hash 12269972, now seen corresponding path program 1 times [2024-01-27 16:12:39,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:12:39,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098289257] [2024-01-27 16:12:39,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:12:39,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:12:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:12:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:12:39,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:12:39,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098289257] [2024-01-27 16:12:39,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098289257] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:12:39,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:12:39,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 16:12:39,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423169738] [2024-01-27 16:12:39,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:12:39,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:12:39,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:12:39,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:12:39,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:12:39,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 49 [2024-01-27 16:12:39,543 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-01-27 16:12:39,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:12:39,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 49 [2024-01-27 16:12:39,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:12:40,172 INFO L124 PetriNetUnfolderBase]: 2495/4136 cut-off events. [2024-01-27 16:12:40,173 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-01-27 16:12:40,183 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 28595 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-01-27 16:12:40,200 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 37 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2024-01-27 16:12:40,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 225 flow [2024-01-27 16:12:40,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:12:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:12:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-01-27 16:12:40,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7891156462585034 [2024-01-27 16:12:40,211 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 116 transitions. [2024-01-27 16:12:40,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 225 flow [2024-01-27 16:12:40,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 218 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 16:12:40,221 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2024-01-27 16:12:40,223 INFO L264 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-01-27 16:12:40,226 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-01-27 16:12:40,227 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2024-01-27 16:12:40,227 INFO L496 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-01-27 16:12:40,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:12:40,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:12:40,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:12:40,227 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:12:40,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:12:40,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1256845437, now seen corresponding path program 1 times [2024-01-27 16:12:40,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:12:40,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408526823] [2024-01-27 16:12:40,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:12:40,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:12:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:12:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:12:40,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:12:40,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408526823] [2024-01-27 16:12:40,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408526823] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:12:40,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:12:40,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:12:40,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381051000] [2024-01-27 16:12:40,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:12:40,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:12:40,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:12:40,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:12:40,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:12:40,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-01-27 16:12:40,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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-01-27 16:12:40,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:12:40,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-01-27 16:12:40,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:12:44,759 INFO L124 PetriNetUnfolderBase]: 36977/52329 cut-off events. [2024-01-27 16:12:44,759 INFO L125 PetriNetUnfolderBase]: For 2383/2383 co-relation queries the response was YES. [2024-01-27 16:12:44,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104650 conditions, 52329 events. 36977/52329 cut-off events. For 2383/2383 co-relation queries the response was YES. Maximal size of possible extension queue 2281. Compared 371864 event pairs, 8591 based on Foata normal form. 0/50996 useless extension candidates. Maximal degree in co-relation 104640. Up to 17928 conditions per place. [2024-01-27 16:12:45,013 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 49 selfloop transitions, 8 changer transitions 103/171 dead transitions. [2024-01-27 16:12:45,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 171 transitions, 694 flow [2024-01-27 16:12:45,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:12:45,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:12:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 297 transitions. [2024-01-27 16:12:45,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2024-01-27 16:12:45,017 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 9 states and 297 transitions. [2024-01-27 16:12:45,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 171 transitions, 694 flow [2024-01-27 16:12:45,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 171 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:12:45,020 INFO L231 Difference]: Finished difference. Result has 67 places, 48 transitions, 202 flow [2024-01-27 16:12:45,020 INFO L264 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=202, PETRI_PLACES=67, PETRI_TRANSITIONS=48} [2024-01-27 16:12:45,021 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2024-01-27 16:12:45,021 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 202 flow [2024-01-27 16:12:45,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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-01-27 16:12:45,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:12:45,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:12:45,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:12:45,022 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:12:45,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:12:45,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1788323934, now seen corresponding path program 1 times [2024-01-27 16:12:45,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:12:45,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637871861] [2024-01-27 16:12:45,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:12:45,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:12:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:12:45,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:12:45,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:12:45,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637871861] [2024-01-27 16:12:45,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637871861] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:12:45,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:12:45,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:12:45,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204636829] [2024-01-27 16:12:45,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:12:45,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:12:45,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:12:45,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:12:45,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:12:45,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-01-27 16:12:45,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 48 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-01-27 16:12:45,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:12:45,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-01-27 16:12:45,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:12:48,301 INFO L124 PetriNetUnfolderBase]: 22398/34766 cut-off events. [2024-01-27 16:12:48,301 INFO L125 PetriNetUnfolderBase]: For 38810/39883 co-relation queries the response was YES. [2024-01-27 16:12:48,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95486 conditions, 34766 events. 22398/34766 cut-off events. For 38810/39883 co-relation queries the response was YES. Maximal size of possible extension queue 1790. Compared 279493 event pairs, 6270 based on Foata normal form. 1025/34904 useless extension candidates. Maximal degree in co-relation 95468. Up to 22082 conditions per place. [2024-01-27 16:12:48,520 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 38 selfloop transitions, 5 changer transitions 51/113 dead transitions. [2024-01-27 16:12:48,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 113 transitions, 676 flow [2024-01-27 16:12:48,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:12:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:12:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2024-01-27 16:12:48,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6239067055393586 [2024-01-27 16:12:48,522 INFO L175 Difference]: Start difference. First operand has 67 places, 48 transitions, 202 flow. Second operand 7 states and 214 transitions. [2024-01-27 16:12:48,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 113 transitions, 676 flow [2024-01-27 16:12:48,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 113 transitions, 598 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-01-27 16:12:48,727 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 245 flow [2024-01-27 16:12:48,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=245, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2024-01-27 16:12:48,728 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2024-01-27 16:12:48,728 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 245 flow [2024-01-27 16:12:48,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-01-27 16:12:48,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:12:48,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:12:48,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:12:48,729 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:12:48,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:12:48,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1965639966, now seen corresponding path program 1 times [2024-01-27 16:12:48,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:12:48,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120857934] [2024-01-27 16:12:48,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:12:48,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:12:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:12:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:12:48,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:12:48,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120857934] [2024-01-27 16:12:48,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120857934] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:12:48,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:12:48,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:12:48,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119375571] [2024-01-27 16:12:48,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:12:48,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:12:48,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:12:48,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:12:48,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:12:48,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-01-27 16:12:48,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 245 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-01-27 16:12:48,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:12:48,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-01-27 16:12:48,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:12:51,799 INFO L124 PetriNetUnfolderBase]: 21298/32913 cut-off events. [2024-01-27 16:12:51,799 INFO L125 PetriNetUnfolderBase]: For 54461/55857 co-relation queries the response was YES. [2024-01-27 16:12:51,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93782 conditions, 32913 events. 21298/32913 cut-off events. For 54461/55857 co-relation queries the response was YES. Maximal size of possible extension queue 1688. Compared 261416 event pairs, 7127 based on Foata normal form. 1116/33329 useless extension candidates. Maximal degree in co-relation 93761. Up to 21538 conditions per place. [2024-01-27 16:12:51,991 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 41 selfloop transitions, 5 changer transitions 49/118 dead transitions. [2024-01-27 16:12:51,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 118 transitions, 689 flow [2024-01-27 16:12:51,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:12:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:12:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2024-01-27 16:12:51,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6384839650145773 [2024-01-27 16:12:51,992 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 245 flow. Second operand 7 states and 219 transitions. [2024-01-27 16:12:51,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 118 transitions, 689 flow [2024-01-27 16:12:52,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 118 transitions, 676 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-01-27 16:12:52,284 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 301 flow [2024-01-27 16:12:52,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2024-01-27 16:12:52,285 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2024-01-27 16:12:52,285 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 301 flow [2024-01-27 16:12:52,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-01-27 16:12:52,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:12:52,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:12:52,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:12:52,286 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:12:52,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:12:52,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1526561309, now seen corresponding path program 1 times [2024-01-27 16:12:52,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:12:52,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236220880] [2024-01-27 16:12:52,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:12:52,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:12:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:12:52,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:12:52,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:12:52,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236220880] [2024-01-27 16:12:52,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236220880] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:12:52,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:12:52,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:12:52,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910436303] [2024-01-27 16:12:52,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:12:52,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:12:52,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:12:52,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:12:52,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:12:52,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-01-27 16:12:52,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 301 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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-01-27 16:12:52,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:12:52,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-01-27 16:12:52,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:12:55,580 INFO L124 PetriNetUnfolderBase]: 24507/35735 cut-off events. [2024-01-27 16:12:55,580 INFO L125 PetriNetUnfolderBase]: For 98185/98266 co-relation queries the response was YES. [2024-01-27 16:12:55,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114814 conditions, 35735 events. 24507/35735 cut-off events. For 98185/98266 co-relation queries the response was YES. Maximal size of possible extension queue 1531. Compared 254014 event pairs, 4222 based on Foata normal form. 933/36563 useless extension candidates. Maximal degree in co-relation 114789. Up to 11661 conditions per place. [2024-01-27 16:12:55,807 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 70 selfloop transitions, 9 changer transitions 94/184 dead transitions. [2024-01-27 16:12:55,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 184 transitions, 1329 flow [2024-01-27 16:12:55,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 16:12:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 16:12:55,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 300 transitions. [2024-01-27 16:12:55,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837 [2024-01-27 16:12:55,812 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 301 flow. Second operand 10 states and 300 transitions. [2024-01-27 16:12:55,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 184 transitions, 1329 flow [2024-01-27 16:12:56,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 184 transitions, 1292 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-01-27 16:12:56,398 INFO L231 Difference]: Finished difference. Result has 82 places, 61 transitions, 392 flow [2024-01-27 16:12:56,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=392, PETRI_PLACES=82, PETRI_TRANSITIONS=61} [2024-01-27 16:12:56,399 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 25 predicate places. [2024-01-27 16:12:56,399 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 61 transitions, 392 flow [2024-01-27 16:12:56,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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-01-27 16:12:56,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:12:56,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:12:56,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:12:56,400 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:12:56,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:12:56,400 INFO L85 PathProgramCache]: Analyzing trace with hash 102920070, now seen corresponding path program 1 times [2024-01-27 16:12:56,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:12:56,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006909712] [2024-01-27 16:12:56,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:12:56,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:12:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:12:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:12:56,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:12:56,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006909712] [2024-01-27 16:12:56,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006909712] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:12:56,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:12:56,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:12:56,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419188466] [2024-01-27 16:12:56,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:12:56,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:12:56,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:12:56,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:12:56,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:12:56,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-01-27 16:12:56,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 61 transitions, 392 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-01-27 16:12:56,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:12:56,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-01-27 16:12:56,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:13:00,803 INFO L124 PetriNetUnfolderBase]: 29729/45156 cut-off events. [2024-01-27 16:13:00,804 INFO L125 PetriNetUnfolderBase]: For 100175/107118 co-relation queries the response was YES. [2024-01-27 16:13:00,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125584 conditions, 45156 events. 29729/45156 cut-off events. For 100175/107118 co-relation queries the response was YES. Maximal size of possible extension queue 1841. Compared 346121 event pairs, 4385 based on Foata normal form. 1704/45507 useless extension candidates. Maximal degree in co-relation 125551. Up to 22322 conditions per place. [2024-01-27 16:13:01,115 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 56 selfloop transitions, 6 changer transitions 0/95 dead transitions. [2024-01-27 16:13:01,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 95 transitions, 614 flow [2024-01-27 16:13:01,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:13:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:13:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2024-01-27 16:13:01,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6989795918367347 [2024-01-27 16:13:01,116 INFO L175 Difference]: Start difference. First operand has 82 places, 61 transitions, 392 flow. Second operand 4 states and 137 transitions. [2024-01-27 16:13:01,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 95 transitions, 614 flow [2024-01-27 16:13:01,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 95 transitions, 591 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-01-27 16:13:01,836 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 415 flow [2024-01-27 16:13:01,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=415, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-01-27 16:13:01,837 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 21 predicate places. [2024-01-27 16:13:01,837 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 415 flow [2024-01-27 16:13:01,837 INFO L496 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-01-27 16:13:01,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:13:01,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:13:01,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:13:01,838 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:13:01,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:13:01,838 INFO L85 PathProgramCache]: Analyzing trace with hash 888728888, now seen corresponding path program 1 times [2024-01-27 16:13:01,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:13:01,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153695228] [2024-01-27 16:13:01,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:13:01,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:13:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:13:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:13:01,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:13:01,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153695228] [2024-01-27 16:13:01,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153695228] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:13:01,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:13:01,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:13:01,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392147520] [2024-01-27 16:13:01,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:13:01,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:13:01,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:13:01,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:13:01,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:13:01,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-01-27 16:13:01,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 415 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-01-27 16:13:01,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:13:01,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-01-27 16:13:01,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:13:05,453 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (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 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) 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_13, ~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[] 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][49], [145#true, Black: 124#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 122#(= ~__unbuffered_p3_EAX~0 0), 50#L771true, Black: 123#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#true, Black: 131#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 69#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 75#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 73#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 70#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 148#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 22#L876true, 120#true, Black: 90#(= ~z~0 0), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 29#P1EXITtrue, Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), 34#L840true, 25#L811true, Black: 106#(= ~y~0 0), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse]) [2024-01-27 16:13:05,453 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-01-27 16:13:05,453 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 16:13:05,453 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 16:13:05,453 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 16:13:06,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (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 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) 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_13, ~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[] 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][49], [32#L882true, 145#true, Black: 124#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 122#(= ~__unbuffered_p3_EAX~0 0), 50#L771true, Black: 123#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#true, Black: 131#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 69#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 75#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 73#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 70#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 148#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 120#true, Black: 90#(= ~z~0 0), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 29#P1EXITtrue, Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), 34#L840true, 25#L811true, Black: 106#(= ~y~0 0), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse]) [2024-01-27 16:13:06,022 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-01-27 16:13:06,022 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 16:13:06,022 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 16:13:06,022 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 16:13:06,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([372] L882-->L885: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= 2 v_~z~0_5) (= 2 v_~y~0_4) (= 2 v_~__unbuffered_p3_EAX~0_3) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p0_EAX~0_3 0))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~y~0=v_~y~0_4} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][81], [145#true, Black: 124#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 50#L771true, Black: 122#(= ~__unbuffered_p3_EAX~0 0), Black: 123#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 153#true, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 69#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 75#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 73#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 70#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 148#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 46#L885true, 48#L824true, 120#true, Black: 90#(= ~z~0 0), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 29#P1EXITtrue, Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), 25#L811true, Black: 106#(= ~y~0 0), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse]) [2024-01-27 16:13:06,494 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is not cut-off event [2024-01-27 16:13:06,494 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-01-27 16:13:06,494 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-01-27 16:13:06,495 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-01-27 16:13:06,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (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 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) 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_13, ~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[] 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][49], [24#P0EXITtrue, 145#true, Black: 124#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 122#(= ~__unbuffered_p3_EAX~0 0), Black: 123#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#true, Black: 131#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 69#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 75#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 73#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 70#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 148#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 22#L876true, 120#true, Black: 90#(= ~z~0 0), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 29#P1EXITtrue, Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), 34#L840true, 25#L811true, Black: 106#(= ~y~0 0), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse]) [2024-01-27 16:13:06,670 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-01-27 16:13:06,670 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 16:13:06,670 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 16:13:06,671 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 16:13:06,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (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 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) 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_13, ~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[] 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][49], [145#true, Black: 124#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 122#(= ~__unbuffered_p3_EAX~0 0), 50#L771true, Black: 123#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#true, Black: 131#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 69#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 51#P2EXITtrue, Black: 75#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 73#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 70#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 148#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 22#L876true, 120#true, Black: 90#(= ~z~0 0), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 29#P1EXITtrue, Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), 34#L840true, Black: 106#(= ~y~0 0), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse]) [2024-01-27 16:13:06,672 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-01-27 16:13:06,672 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 16:13:06,672 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 16:13:06,672 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 16:13:07,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (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 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) 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_13, ~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[] 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][49], [24#P0EXITtrue, 145#true, Black: 124#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 122#(= ~__unbuffered_p3_EAX~0 0), Black: 123#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#true, Black: 131#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 69#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 75#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 73#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 70#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 148#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 22#L876true, 120#true, Black: 90#(= ~z~0 0), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 29#P1EXITtrue, Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), 41#L814true, 34#L840true, Black: 106#(= ~y~0 0), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse]) [2024-01-27 16:13:07,122 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-01-27 16:13:07,122 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 16:13:07,122 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 16:13:07,122 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 16:13:07,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (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 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) 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_13, ~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[] 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][49], [24#P0EXITtrue, 32#L882true, 145#true, Black: 124#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 122#(= ~__unbuffered_p3_EAX~0 0), Black: 123#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#true, Black: 131#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 69#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 75#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 73#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 70#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 148#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 120#true, Black: 90#(= ~z~0 0), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 29#P1EXITtrue, Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), 34#L840true, 25#L811true, Black: 106#(= ~y~0 0), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse]) [2024-01-27 16:13:07,123 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-01-27 16:13:07,123 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 16:13:07,123 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 16:13:07,123 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 16:13:07,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (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 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) 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_13, ~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[] 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][49], [32#L882true, 145#true, Black: 124#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 122#(= ~__unbuffered_p3_EAX~0 0), 50#L771true, Black: 123#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#true, Black: 131#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 69#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 51#P2EXITtrue, Black: 75#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 73#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 70#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 148#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 120#true, Black: 90#(= ~z~0 0), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 29#P1EXITtrue, Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), 34#L840true, Black: 106#(= ~y~0 0), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse]) [2024-01-27 16:13:07,123 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-01-27 16:13:07,124 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 16:13:07,124 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 16:13:07,124 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 16:13:07,213 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([372] L882-->L885: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= 2 v_~z~0_5) (= 2 v_~y~0_4) (= 2 v_~__unbuffered_p3_EAX~0_3) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p0_EAX~0_3 0))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~y~0=v_~y~0_4} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][81], [24#P0EXITtrue, 145#true, Black: 124#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 122#(= ~__unbuffered_p3_EAX~0 0), Black: 123#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 153#true, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 69#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 75#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 73#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 70#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 148#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 46#L885true, 48#L824true, 120#true, Black: 90#(= ~z~0 0), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 29#P1EXITtrue, Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), 25#L811true, Black: 106#(= ~y~0 0), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse]) [2024-01-27 16:13:07,213 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-01-27 16:13:07,213 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-01-27 16:13:07,213 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-01-27 16:13:07,213 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-01-27 16:13:07,575 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([372] L882-->L885: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= 2 v_~z~0_5) (= 2 v_~y~0_4) (= 2 v_~__unbuffered_p3_EAX~0_3) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p0_EAX~0_3 0))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~y~0=v_~y~0_4} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][81], [145#true, Black: 124#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 50#L771true, Black: 122#(= ~__unbuffered_p3_EAX~0 0), Black: 123#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 153#true, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 69#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 75#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 51#P2EXITtrue, Black: 73#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 70#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 148#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 46#L885true, 48#L824true, 120#true, Black: 90#(= ~z~0 0), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 29#P1EXITtrue, Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 106#(= ~y~0 0), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse]) [2024-01-27 16:13:07,575 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-01-27 16:13:07,575 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-01-27 16:13:07,575 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-01-27 16:13:07,575 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-01-27 16:13:07,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (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 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) 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_13, ~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[] 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][49], [24#P0EXITtrue, 145#true, Black: 124#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 122#(= ~__unbuffered_p3_EAX~0 0), Black: 123#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#true, Black: 131#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 69#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 75#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 51#P2EXITtrue, Black: 73#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 70#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 148#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 22#L876true, 120#true, Black: 90#(= ~z~0 0), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 29#P1EXITtrue, Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), 34#L840true, Black: 106#(= ~y~0 0), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse]) [2024-01-27 16:13:07,681 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-01-27 16:13:07,681 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 16:13:07,681 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 16:13:07,681 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 16:13:07,684 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (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 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) 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_13, ~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[] 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][49], [24#P0EXITtrue, 32#L882true, 145#true, Black: 124#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 122#(= ~__unbuffered_p3_EAX~0 0), Black: 123#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#true, Black: 131#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 69#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 75#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 73#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 70#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 148#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 120#true, Black: 90#(= ~z~0 0), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 29#P1EXITtrue, Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), 41#L814true, 34#L840true, Black: 106#(= ~y~0 0), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse]) [2024-01-27 16:13:07,685 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-01-27 16:13:07,685 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 16:13:07,685 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 16:13:07,685 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 16:13:07,737 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([372] L882-->L885: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= 2 v_~z~0_5) (= 2 v_~y~0_4) (= 2 v_~__unbuffered_p3_EAX~0_3) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p0_EAX~0_3 0))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~y~0=v_~y~0_4} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][81], [24#P0EXITtrue, 145#true, Black: 124#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 122#(= ~__unbuffered_p3_EAX~0 0), Black: 123#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 153#true, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 69#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 75#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 73#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 70#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 148#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 46#L885true, 48#L824true, 120#true, Black: 90#(= ~z~0 0), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 29#P1EXITtrue, Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), 41#L814true, Black: 106#(= ~y~0 0), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse]) [2024-01-27 16:13:07,737 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-01-27 16:13:07,738 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-01-27 16:13:07,738 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-01-27 16:13:07,738 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-01-27 16:13:07,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (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 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) 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_13, ~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[] 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][49], [24#P0EXITtrue, 32#L882true, 145#true, Black: 124#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 122#(= ~__unbuffered_p3_EAX~0 0), Black: 123#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 153#true, Black: 131#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 69#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 75#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 51#P2EXITtrue, Black: 73#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 70#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 148#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 120#true, Black: 90#(= ~z~0 0), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 29#P1EXITtrue, Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), 34#L840true, Black: 106#(= ~y~0 0), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse]) [2024-01-27 16:13:07,929 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-27 16:13:07,930 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 16:13:07,930 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 16:13:07,930 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 16:13:07,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([372] L882-->L885: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= 2 v_~z~0_5) (= 2 v_~y~0_4) (= 2 v_~__unbuffered_p3_EAX~0_3) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p0_EAX~0_3 0))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~y~0=v_~y~0_4} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][81], [24#P0EXITtrue, 145#true, Black: 124#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 122#(= ~__unbuffered_p3_EAX~0 0), Black: 123#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 153#true, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 69#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 51#P2EXITtrue, Black: 75#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 73#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 70#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 148#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 150#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 46#L885true, 48#L824true, 120#true, Black: 90#(= ~z~0 0), Black: 96#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 29#P1EXITtrue, Black: 94#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 106#(= ~y~0 0), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 110#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse]) [2024-01-27 16:13:07,960 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2024-01-27 16:13:07,960 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-01-27 16:13:07,960 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-01-27 16:13:07,960 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-01-27 16:13:08,490 INFO L124 PetriNetUnfolderBase]: 41138/63853 cut-off events. [2024-01-27 16:13:08,490 INFO L125 PetriNetUnfolderBase]: For 132550/140832 co-relation queries the response was YES. [2024-01-27 16:13:08,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189197 conditions, 63853 events. 41138/63853 cut-off events. For 132550/140832 co-relation queries the response was YES. Maximal size of possible extension queue 3099. Compared 551478 event pairs, 16816 based on Foata normal form. 1473/60626 useless extension candidates. Maximal degree in co-relation 189163. Up to 22894 conditions per place. [2024-01-27 16:13:08,922 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 91 selfloop transitions, 14 changer transitions 0/135 dead transitions. [2024-01-27 16:13:08,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 135 transitions, 895 flow [2024-01-27 16:13:08,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:13:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:13:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2024-01-27 16:13:08,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6588921282798834 [2024-01-27 16:13:08,923 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 415 flow. Second operand 7 states and 226 transitions. [2024-01-27 16:13:08,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 135 transitions, 895 flow [2024-01-27 16:13:09,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 135 transitions, 875 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-01-27 16:13:09,137 INFO L231 Difference]: Finished difference. Result has 84 places, 71 transitions, 510 flow [2024-01-27 16:13:09,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=510, PETRI_PLACES=84, PETRI_TRANSITIONS=71} [2024-01-27 16:13:09,138 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places. [2024-01-27 16:13:09,138 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 510 flow [2024-01-27 16:13:09,138 INFO L496 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-01-27 16:13:09,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:13:09,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:13:09,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:13:09,139 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:13:09,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:13:09,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1833523086, now seen corresponding path program 1 times [2024-01-27 16:13:09,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:13:09,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844637237] [2024-01-27 16:13:09,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:13:09,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:13:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:13:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:13:09,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:13:09,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844637237] [2024-01-27 16:13:09,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844637237] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:13:09,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:13:09,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:13:09,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792512463] [2024-01-27 16:13:09,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:13:09,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:13:09,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:13:09,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:13:09,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:13:09,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-01-27 16:13:09,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 71 transitions, 510 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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-01-27 16:13:09,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:13:09,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-01-27 16:13:09,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand