./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix055_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 80b1b132 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/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix055_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-?-80b1b13-m [2024-01-31 17:39:33,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:39:33,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 17:39:33,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:39:33,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:39:33,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:39:33,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:39:33,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:39:33,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:39:33,372 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:39:33,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:39:33,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:39:33,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:39:33,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:39:33,373 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:39:33,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:39:33,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:39:33,374 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:39:33,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 17:39:33,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:39:33,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:39:33,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:39:33,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:39:33,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:39:33,376 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:39:33,376 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:39:33,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:39:33,377 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:39:33,377 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:39:33,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:39:33,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:39:33,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:39:33,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:39:33,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:39:33,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:39:33,379 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:39:33,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 17:39:33,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 17:39:33,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:39:33,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:39:33,380 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:39:33,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:39:33,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:39:33,381 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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-31 17:39:33,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:39:33,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:39:33,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:39:33,632 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:39:33,633 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:39:33,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix055_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-01-31 17:39:34,153 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:39:34,153 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:39:34,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2024-01-31 17:39:35,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:39:35,523 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:39:35,527 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2024-01-31 17:39:35,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8176aa60/3a64b124dd0a43d482cf594190c9c9d2/FLAGfcdb1410d [2024-01-31 17:39:35,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8176aa60/3a64b124dd0a43d482cf594190c9c9d2 [2024-01-31 17:39:35,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:39:35,819 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:39:35,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:39:35,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:39:35,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:39:35,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:39:34" (1/2) ... [2024-01-31 17:39:35,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10224bc5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:35, skipping insertion in model container [2024-01-31 17:39:35,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:39:34" (1/2) ... [2024-01-31 17:39:35,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7357a279 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:39:35, skipping insertion in model container [2024-01-31 17:39:35,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:39:35" (2/2) ... [2024-01-31 17:39:35,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10224bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:35, skipping insertion in model container [2024-01-31 17:39:35,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:39:35" (2/2) ... [2024-01-31 17:39:35,827 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:39:37,780 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 17:39:37,781 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L18] expression == 1 [2024-01-31 17:39:37,781 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] expression == 0 [2024-01-31 17:39:37,808 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:39:37,957 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-01-31 17:39:38,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:39:38,120 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:39:38,129 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] Start Parsing Local [2024-01-31 17:39:38,152 WARN L424 MainDispatcher]: Unable to annotate ; with a witness entry [2024-01-31 17:39:38,185 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:39:38,229 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:39:38,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:38 WrapperNode [2024-01-31 17:39:38,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:39:38,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:39:38,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:39:38,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:39:38,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:38" (1/1) ... [2024-01-31 17:39:38,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:38" (1/1) ... [2024-01-31 17:39:38,289 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2024-01-31 17:39:38,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:39:38,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:39:38,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:39:38,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:39:38,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:38" (1/1) ... [2024-01-31 17:39:38,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:38" (1/1) ... [2024-01-31 17:39:38,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:38" (1/1) ... [2024-01-31 17:39:38,337 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-31 17:39:38,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:38" (1/1) ... [2024-01-31 17:39:38,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:38" (1/1) ... [2024-01-31 17:39:38,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:38" (1/1) ... [2024-01-31 17:39:38,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:38" (1/1) ... [2024-01-31 17:39:38,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:38" (1/1) ... [2024-01-31 17:39:38,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:38" (1/1) ... [2024-01-31 17:39:38,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:39:38,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:39:38,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:39:38,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:39:38,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:38" (1/1) ... [2024-01-31 17:39:38,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:39:38,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:39:38,398 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-31 17:39:38,412 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-31 17:39:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 17:39:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 17:39:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 17:39:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 17:39:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 17:39:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:39:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:39:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:39:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:39:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-31 17:39:38,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-31 17:39:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-31 17:39:38,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-31 17:39:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-31 17:39:38,433 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-31 17:39:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-01-31 17:39:38,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-01-31 17:39:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 17:39:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 17:39:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 17:39:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 17:39:38,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 17:39:38,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:39:38,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:39:38,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:39:38,436 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 17:39:38,583 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:39:38,585 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:39:38,845 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:39:38,845 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:39:38,958 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:39:38,958 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 17:39:38,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:39:38 BoogieIcfgContainer [2024-01-31 17:39:38,959 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:39:38,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:39:38,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:39:38,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:39:38,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:39:34" (1/4) ... [2024-01-31 17:39:38,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503983a1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:39:38, skipping insertion in model container [2024-01-31 17:39:38,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:39:35" (2/4) ... [2024-01-31 17:39:38,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503983a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:39:38, skipping insertion in model container [2024-01-31 17:39:38,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:39:38" (3/4) ... [2024-01-31 17:39:38,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503983a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:39:38, skipping insertion in model container [2024-01-31 17:39:38,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:39:38" (4/4) ... [2024-01-31 17:39:38,966 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_power.oepc_pso.oepc_rmo.oepc.i [2024-01-31 17:39:38,979 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:39:38,981 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-01-31 17:39:38,981 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:39:39,029 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-31 17:39:39,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 51 transitions, 118 flow [2024-01-31 17:39:39,090 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2024-01-31 17:39:39,090 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:39:39,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 1/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2024-01-31 17:39:39,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 51 transitions, 118 flow [2024-01-31 17:39:39,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 47 transitions, 106 flow [2024-01-31 17:39:39,116 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:39:39,122 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=false, 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;@2e24a5fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:39:39,123 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-01-31 17:39:39,128 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:39:39,128 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-01-31 17:39:39,128 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:39:39,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:39,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 17:39:39,130 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:39,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:39,135 INFO L85 PathProgramCache]: Analyzing trace with hash 12157759, now seen corresponding path program 1 times [2024-01-31 17:39:39,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:39,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340254548] [2024-01-31 17:39:39,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:39,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:39,382 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-31 17:39:39,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:39,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340254548] [2024-01-31 17:39:39,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340254548] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:39,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:39,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:39:39,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511722018] [2024-01-31 17:39:39,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:39,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-31 17:39:39,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:39,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-31 17:39:39,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-31 17:39:39,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 51 [2024-01-31 17:39:39,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 106 flow. Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-31 17:39:39,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:39,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 51 [2024-01-31 17:39:39,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:40,162 INFO L124 PetriNetUnfolderBase]: 3179/5868 cut-off events. [2024-01-31 17:39:40,162 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:39:40,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10396 conditions, 5868 events. 3179/5868 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 46279 event pairs, 3179 based on Foata normal form. 180/5274 useless extension candidates. Maximal degree in co-relation 10384. Up to 4391 conditions per place. [2024-01-31 17:39:40,201 INFO L140 encePairwiseOnDemand]: 49/51 looper letters, 24 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2024-01-31 17:39:40,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 45 transitions, 150 flow [2024-01-31 17:39:40,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-31 17:39:40,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-31 17:39:40,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2024-01-31 17:39:40,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7450980392156863 [2024-01-31 17:39:40,214 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 106 flow. Second operand 2 states and 76 transitions. [2024-01-31 17:39:40,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 45 transitions, 150 flow [2024-01-31 17:39:40,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 146 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 17:39:40,224 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 98 flow [2024-01-31 17:39:40,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2024-01-31 17:39:40,228 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2024-01-31 17:39:40,229 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 98 flow [2024-01-31 17:39:40,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-31 17:39:40,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:40,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 17:39:40,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 17:39:40,230 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:40,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:40,231 INFO L85 PathProgramCache]: Analyzing trace with hash 12157760, now seen corresponding path program 1 times [2024-01-31 17:39:40,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:40,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358035021] [2024-01-31 17:39:40,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:40,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:40,497 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-31 17:39:40,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:40,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358035021] [2024-01-31 17:39:40,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358035021] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:40,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:40,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:39:40,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131166056] [2024-01-31 17:39:40,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:40,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:39:40,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:40,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:39:40,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:39:40,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 51 [2024-01-31 17:39:40,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-31 17:39:40,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:40,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 51 [2024-01-31 17:39:40,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:41,017 INFO L124 PetriNetUnfolderBase]: 2495/4244 cut-off events. [2024-01-31 17:39:41,018 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:39:41,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7817 conditions, 4244 events. 2495/4244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 30443 event pairs, 443 based on Foata normal form. 0/4134 useless extension candidates. Maximal degree in co-relation 7814. Up to 2779 conditions per place. [2024-01-31 17:39:41,039 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 37 selfloop transitions, 2 changer transitions 2/62 dead transitions. [2024-01-31 17:39:41,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 62 transitions, 220 flow [2024-01-31 17:39:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:39:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:39:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-01-31 17:39:41,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2024-01-31 17:39:41,044 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 98 flow. Second operand 3 states and 117 transitions. [2024-01-31 17:39:41,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 62 transitions, 220 flow [2024-01-31 17:39:41,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 17:39:41,051 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 98 flow [2024-01-31 17:39:41,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-01-31 17:39:41,052 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2024-01-31 17:39:41,053 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 98 flow [2024-01-31 17:39:41,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-31 17:39:41,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:41,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:41,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 17:39:41,054 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:41,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:41,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1836579791, now seen corresponding path program 1 times [2024-01-31 17:39:41,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:41,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169650745] [2024-01-31 17:39:41,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:41,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:41,136 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-31 17:39:41,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:41,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169650745] [2024-01-31 17:39:41,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169650745] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:41,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:41,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:39:41,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709802499] [2024-01-31 17:39:41,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:41,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:39:41,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:41,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:39:41,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:39:41,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-01-31 17:39:41,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-31 17:39:41,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:41,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-01-31 17:39:41,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:41,625 INFO L124 PetriNetUnfolderBase]: 3311/5175 cut-off events. [2024-01-31 17:39:41,625 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2024-01-31 17:39:41,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10168 conditions, 5175 events. 3311/5175 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 34530 event pairs, 2495 based on Foata normal form. 0/4893 useless extension candidates. Maximal degree in co-relation 10164. Up to 3465 conditions per place. [2024-01-31 17:39:41,649 INFO L140 encePairwiseOnDemand]: 49/51 looper letters, 33 selfloop transitions, 1 changer transitions 1/52 dead transitions. [2024-01-31 17:39:41,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 188 flow [2024-01-31 17:39:41,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:39:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:39:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-01-31 17:39:41,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2024-01-31 17:39:41,651 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 98 flow. Second operand 3 states and 99 transitions. [2024-01-31 17:39:41,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 188 flow [2024-01-31 17:39:41,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:39:41,652 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 92 flow [2024-01-31 17:39:41,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2024-01-31 17:39:41,653 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2024-01-31 17:39:41,653 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 92 flow [2024-01-31 17:39:41,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-31 17:39:41,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:41,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:41,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 17:39:41,654 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:41,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1099398265, now seen corresponding path program 1 times [2024-01-31 17:39:41,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:41,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182861780] [2024-01-31 17:39:41,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:41,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:41,869 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-31 17:39:41,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:41,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182861780] [2024-01-31 17:39:41,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182861780] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:41,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:41,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:39:41,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035790109] [2024-01-31 17:39:41,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:41,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:39:41,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:41,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:39:41,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:39:41,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51 [2024-01-31 17:39:41,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-31 17:39:41,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:41,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51 [2024-01-31 17:39:41,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:45,443 INFO L124 PetriNetUnfolderBase]: 27859/40172 cut-off events. [2024-01-31 17:39:45,443 INFO L125 PetriNetUnfolderBase]: For 912/912 co-relation queries the response was YES. [2024-01-31 17:39:45,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79046 conditions, 40172 events. 27859/40172 cut-off events. For 912/912 co-relation queries the response was YES. Maximal size of possible extension queue 1792. Compared 285046 event pairs, 8327 based on Foata normal form. 932/41062 useless extension candidates. Maximal degree in co-relation 79042. Up to 17059 conditions per place. [2024-01-31 17:39:45,645 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 48 selfloop transitions, 7 changer transitions 63/129 dead transitions. [2024-01-31 17:39:45,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 129 transitions, 510 flow [2024-01-31 17:39:45,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:39:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:39:45,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2024-01-31 17:39:45,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6302521008403361 [2024-01-31 17:39:45,651 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 92 flow. Second operand 7 states and 225 transitions. [2024-01-31 17:39:45,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 129 transitions, 510 flow [2024-01-31 17:39:45,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 129 transitions, 508 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:39:45,849 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 177 flow [2024-01-31 17:39:45,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=177, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2024-01-31 17:39:45,851 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 5 predicate places. [2024-01-31 17:39:45,851 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 177 flow [2024-01-31 17:39:45,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-31 17:39:45,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:45,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:45,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 17:39:45,852 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:45,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:45,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1936707962, now seen corresponding path program 1 times [2024-01-31 17:39:45,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:45,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622797180] [2024-01-31 17:39:45,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:45,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:46,009 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-31 17:39:46,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:46,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622797180] [2024-01-31 17:39:46,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622797180] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:46,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:46,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:39:46,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515265777] [2024-01-31 17:39:46,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:46,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:39:46,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:46,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:39:46,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:39:46,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2024-01-31 17:39:46,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-31 17:39:46,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:46,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2024-01-31 17:39:46,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:49,152 INFO L124 PetriNetUnfolderBase]: 21912/33000 cut-off events. [2024-01-31 17:39:49,152 INFO L125 PetriNetUnfolderBase]: For 25970/26468 co-relation queries the response was YES. [2024-01-31 17:39:49,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85473 conditions, 33000 events. 21912/33000 cut-off events. For 25970/26468 co-relation queries the response was YES. Maximal size of possible extension queue 1662. Compared 252031 event pairs, 7078 based on Foata normal form. 900/33353 useless extension candidates. Maximal degree in co-relation 85464. Up to 23635 conditions per place. [2024-01-31 17:39:49,381 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 39 selfloop transitions, 5 changer transitions 51/112 dead transitions. [2024-01-31 17:39:49,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 112 transitions, 629 flow [2024-01-31 17:39:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:39:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:39:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 208 transitions. [2024-01-31 17:39:49,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5826330532212886 [2024-01-31 17:39:49,383 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 177 flow. Second operand 7 states and 208 transitions. [2024-01-31 17:39:49,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 112 transitions, 629 flow [2024-01-31 17:39:49,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 112 transitions, 591 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:39:49,428 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 236 flow [2024-01-31 17:39:49,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2024-01-31 17:39:49,429 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places. [2024-01-31 17:39:49,429 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 236 flow [2024-01-31 17:39:49,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-31 17:39:49,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:49,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:49,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 17:39:49,430 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:49,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:49,430 INFO L85 PathProgramCache]: Analyzing trace with hash 466951430, now seen corresponding path program 1 times [2024-01-31 17:39:49,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:49,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833171683] [2024-01-31 17:39:49,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:49,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:49,554 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-31 17:39:49,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:49,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833171683] [2024-01-31 17:39:49,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833171683] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:49,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:49,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:39:49,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717596000] [2024-01-31 17:39:49,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:49,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:39:49,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:49,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:39:49,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:39:49,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2024-01-31 17:39:49,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-31 17:39:49,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:49,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2024-01-31 17:39:49,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:50,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L819-->L835: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_76 256) 0)) (.cse9 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_146 256) 0)) (.cse1 (and .cse9 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse9 .cse5))) (let ((.cse6 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_145 256) 0)) (.cse7 (or .cse11 .cse1 .cse2)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0)))) (and (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_50) (= (ite .cse0 v_~a$r_buff1_thd4~0_76 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse4 .cse5) .cse3 (and .cse4 .cse6))) v_~a$r_buff1_thd4~0_76 0)) v_~a$r_buff1_thd4~0_75) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_77 v_~a$mem_tmp~0_20) (= (ite .cse7 v_~a~0_77 (ite .cse8 v_~a$w_buff0~0_51 v_~a$w_buff1~0_50)) v_~__unbuffered_p3_EAX~0_20) (= (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or (and .cse9 .cse6) .cse2 .cse3) v_~a$r_buff0_thd4~0_76 (ite (and (not .cse3) .cse10) 0 v_~a$r_buff0_thd4~0_76))) v_~a$r_buff0_thd4~0_75) (= v_~a$w_buff0_used~0_145 (ite .cse0 v_~a$w_buff0_used~0_146 (ite .cse7 v_~a$w_buff0_used~0_146 (ite .cse8 0 v_~a$w_buff0_used~0_146)))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 v_~__unbuffered_p3_EAX~0_20)))))) InVars {~a~0=v_~a~0_77, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_76, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_146, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_75, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_145, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_36, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~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, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][53], [P2Thread1of1ForFork0InUse, 30#L769true, 37#L835true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), Black: 93#(= ~z~0 0), 107#true, Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 84#(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))), 46#L789true, P1Thread1of1ForFork3InUse, Black: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 19#L866-3true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:50,198 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-01-31 17:39:50,198 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:39:50,198 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:39:50,198 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:39:50,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L819-->L835: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_76 256) 0)) (.cse9 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_146 256) 0)) (.cse1 (and .cse9 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse9 .cse5))) (let ((.cse6 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_145 256) 0)) (.cse7 (or .cse11 .cse1 .cse2)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0)))) (and (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_50) (= (ite .cse0 v_~a$r_buff1_thd4~0_76 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse4 .cse5) .cse3 (and .cse4 .cse6))) v_~a$r_buff1_thd4~0_76 0)) v_~a$r_buff1_thd4~0_75) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_77 v_~a$mem_tmp~0_20) (= (ite .cse7 v_~a~0_77 (ite .cse8 v_~a$w_buff0~0_51 v_~a$w_buff1~0_50)) v_~__unbuffered_p3_EAX~0_20) (= (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or (and .cse9 .cse6) .cse2 .cse3) v_~a$r_buff0_thd4~0_76 (ite (and (not .cse3) .cse10) 0 v_~a$r_buff0_thd4~0_76))) v_~a$r_buff0_thd4~0_75) (= v_~a$w_buff0_used~0_145 (ite .cse0 v_~a$w_buff0_used~0_146 (ite .cse7 v_~a$w_buff0_used~0_146 (ite .cse8 0 v_~a$w_buff0_used~0_146)))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 v_~__unbuffered_p3_EAX~0_20)))))) InVars {~a~0=v_~a~0_77, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_76, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_146, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_75, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_145, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_36, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~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, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][53], [P2Thread1of1ForFork0InUse, 30#L769true, 37#L835true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 107#true, Black: 93#(= ~z~0 0), Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 35#L867true, Black: 84#(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: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork3InUse, 46#L789true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:50,281 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-01-31 17:39:50,281 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:39:50,281 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:39:50,281 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-31 17:39:50,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L819-->L835: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_76 256) 0)) (.cse9 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_146 256) 0)) (.cse1 (and .cse9 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse9 .cse5))) (let ((.cse6 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_145 256) 0)) (.cse7 (or .cse11 .cse1 .cse2)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0)))) (and (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_50) (= (ite .cse0 v_~a$r_buff1_thd4~0_76 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse4 .cse5) .cse3 (and .cse4 .cse6))) v_~a$r_buff1_thd4~0_76 0)) v_~a$r_buff1_thd4~0_75) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_77 v_~a$mem_tmp~0_20) (= (ite .cse7 v_~a~0_77 (ite .cse8 v_~a$w_buff0~0_51 v_~a$w_buff1~0_50)) v_~__unbuffered_p3_EAX~0_20) (= (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or (and .cse9 .cse6) .cse2 .cse3) v_~a$r_buff0_thd4~0_76 (ite (and (not .cse3) .cse10) 0 v_~a$r_buff0_thd4~0_76))) v_~a$r_buff0_thd4~0_75) (= v_~a$w_buff0_used~0_145 (ite .cse0 v_~a$w_buff0_used~0_146 (ite .cse7 v_~a$w_buff0_used~0_146 (ite .cse8 0 v_~a$w_buff0_used~0_146)))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 v_~__unbuffered_p3_EAX~0_20)))))) InVars {~a~0=v_~a~0_77, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_76, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_146, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_75, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_145, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_36, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~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, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][53], [P2Thread1of1ForFork0InUse, 37#L835true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 107#true, Black: 93#(= ~z~0 0), Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, 25#P0EXITtrue, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 35#L867true, Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 84#(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: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 46#L789true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:50,555 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-01-31 17:39:50,556 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:39:50,556 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:39:50,556 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:39:50,556 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L819-->L835: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_76 256) 0)) (.cse9 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_146 256) 0)) (.cse1 (and .cse9 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse9 .cse5))) (let ((.cse6 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_145 256) 0)) (.cse7 (or .cse11 .cse1 .cse2)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0)))) (and (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_50) (= (ite .cse0 v_~a$r_buff1_thd4~0_76 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse4 .cse5) .cse3 (and .cse4 .cse6))) v_~a$r_buff1_thd4~0_76 0)) v_~a$r_buff1_thd4~0_75) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_77 v_~a$mem_tmp~0_20) (= (ite .cse7 v_~a~0_77 (ite .cse8 v_~a$w_buff0~0_51 v_~a$w_buff1~0_50)) v_~__unbuffered_p3_EAX~0_20) (= (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or (and .cse9 .cse6) .cse2 .cse3) v_~a$r_buff0_thd4~0_76 (ite (and (not .cse3) .cse10) 0 v_~a$r_buff0_thd4~0_76))) v_~a$r_buff0_thd4~0_75) (= v_~a$w_buff0_used~0_145 (ite .cse0 v_~a$w_buff0_used~0_146 (ite .cse7 v_~a$w_buff0_used~0_146 (ite .cse8 0 v_~a$w_buff0_used~0_146)))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 v_~__unbuffered_p3_EAX~0_20)))))) InVars {~a~0=v_~a~0_77, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_76, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_146, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_75, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_145, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_36, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~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, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][53], [P2Thread1of1ForFork0InUse, 37#L835true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 107#true, Black: 93#(= ~z~0 0), Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, 25#P0EXITtrue, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 84#(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))), 46#L789true, Black: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork3InUse, 19#L866-3true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:50,556 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-01-31 17:39:50,556 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:39:50,556 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:39:50,557 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:39:50,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L819-->L835: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_76 256) 0)) (.cse9 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_146 256) 0)) (.cse1 (and .cse9 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse9 .cse5))) (let ((.cse6 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_145 256) 0)) (.cse7 (or .cse11 .cse1 .cse2)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0)))) (and (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_50) (= (ite .cse0 v_~a$r_buff1_thd4~0_76 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse4 .cse5) .cse3 (and .cse4 .cse6))) v_~a$r_buff1_thd4~0_76 0)) v_~a$r_buff1_thd4~0_75) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_77 v_~a$mem_tmp~0_20) (= (ite .cse7 v_~a~0_77 (ite .cse8 v_~a$w_buff0~0_51 v_~a$w_buff1~0_50)) v_~__unbuffered_p3_EAX~0_20) (= (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or (and .cse9 .cse6) .cse2 .cse3) v_~a$r_buff0_thd4~0_76 (ite (and (not .cse3) .cse10) 0 v_~a$r_buff0_thd4~0_76))) v_~a$r_buff0_thd4~0_75) (= v_~a$w_buff0_used~0_145 (ite .cse0 v_~a$w_buff0_used~0_146 (ite .cse7 v_~a$w_buff0_used~0_146 (ite .cse8 0 v_~a$w_buff0_used~0_146)))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 v_~__unbuffered_p3_EAX~0_20)))))) InVars {~a~0=v_~a~0_77, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_76, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_146, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_75, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_145, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_36, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~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, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][53], [P2Thread1of1ForFork0InUse, 30#L769true, 37#L835true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 107#true, Black: 93#(= ~z~0 0), Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 31#P1EXITtrue, Black: 84#(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: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork3InUse, 19#L866-3true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:50,562 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-01-31 17:39:50,562 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:39:50,562 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:39:50,562 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-31 17:39:50,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L819-->L835: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_76 256) 0)) (.cse9 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_146 256) 0)) (.cse1 (and .cse9 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse9 .cse5))) (let ((.cse6 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_145 256) 0)) (.cse7 (or .cse11 .cse1 .cse2)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0)))) (and (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_50) (= (ite .cse0 v_~a$r_buff1_thd4~0_76 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse4 .cse5) .cse3 (and .cse4 .cse6))) v_~a$r_buff1_thd4~0_76 0)) v_~a$r_buff1_thd4~0_75) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_77 v_~a$mem_tmp~0_20) (= (ite .cse7 v_~a~0_77 (ite .cse8 v_~a$w_buff0~0_51 v_~a$w_buff1~0_50)) v_~__unbuffered_p3_EAX~0_20) (= (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or (and .cse9 .cse6) .cse2 .cse3) v_~a$r_buff0_thd4~0_76 (ite (and (not .cse3) .cse10) 0 v_~a$r_buff0_thd4~0_76))) v_~a$r_buff0_thd4~0_75) (= v_~a$w_buff0_used~0_145 (ite .cse0 v_~a$w_buff0_used~0_146 (ite .cse7 v_~a$w_buff0_used~0_146 (ite .cse8 0 v_~a$w_buff0_used~0_146)))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 v_~__unbuffered_p3_EAX~0_20)))))) InVars {~a~0=v_~a~0_77, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_76, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_146, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_75, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_145, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_36, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~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, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][53], [P2Thread1of1ForFork0InUse, 30#L769true, 37#L835true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 107#true, Black: 93#(= ~z~0 0), Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 35#L867true, Black: 84#(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))), 31#P1EXITtrue, Black: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:50,667 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-01-31 17:39:50,667 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:39:50,667 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:39:50,667 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:39:50,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L819-->L835: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_76 256) 0)) (.cse9 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_146 256) 0)) (.cse1 (and .cse9 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse9 .cse5))) (let ((.cse6 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_145 256) 0)) (.cse7 (or .cse11 .cse1 .cse2)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0)))) (and (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_50) (= (ite .cse0 v_~a$r_buff1_thd4~0_76 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse4 .cse5) .cse3 (and .cse4 .cse6))) v_~a$r_buff1_thd4~0_76 0)) v_~a$r_buff1_thd4~0_75) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_77 v_~a$mem_tmp~0_20) (= (ite .cse7 v_~a~0_77 (ite .cse8 v_~a$w_buff0~0_51 v_~a$w_buff1~0_50)) v_~__unbuffered_p3_EAX~0_20) (= (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or (and .cse9 .cse6) .cse2 .cse3) v_~a$r_buff0_thd4~0_76 (ite (and (not .cse3) .cse10) 0 v_~a$r_buff0_thd4~0_76))) v_~a$r_buff0_thd4~0_75) (= v_~a$w_buff0_used~0_145 (ite .cse0 v_~a$w_buff0_used~0_146 (ite .cse7 v_~a$w_buff0_used~0_146 (ite .cse8 0 v_~a$w_buff0_used~0_146)))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 v_~__unbuffered_p3_EAX~0_20)))))) InVars {~a~0=v_~a~0_77, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_76, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_146, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_75, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_145, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_36, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~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, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][53], [P2Thread1of1ForFork0InUse, 30#L769true, 37#L835true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 107#true, Black: 93#(= ~z~0 0), Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 28#L871true, Black: 84#(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: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 46#L789true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:50,673 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-01-31 17:39:50,673 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:39:50,673 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:39:50,673 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-31 17:39:50,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L819-->L835: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_76 256) 0)) (.cse9 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_146 256) 0)) (.cse1 (and .cse9 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse9 .cse5))) (let ((.cse6 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_145 256) 0)) (.cse7 (or .cse11 .cse1 .cse2)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0)))) (and (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_50) (= (ite .cse0 v_~a$r_buff1_thd4~0_76 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse4 .cse5) .cse3 (and .cse4 .cse6))) v_~a$r_buff1_thd4~0_76 0)) v_~a$r_buff1_thd4~0_75) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_77 v_~a$mem_tmp~0_20) (= (ite .cse7 v_~a~0_77 (ite .cse8 v_~a$w_buff0~0_51 v_~a$w_buff1~0_50)) v_~__unbuffered_p3_EAX~0_20) (= (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or (and .cse9 .cse6) .cse2 .cse3) v_~a$r_buff0_thd4~0_76 (ite (and (not .cse3) .cse10) 0 v_~a$r_buff0_thd4~0_76))) v_~a$r_buff0_thd4~0_75) (= v_~a$w_buff0_used~0_145 (ite .cse0 v_~a$w_buff0_used~0_146 (ite .cse7 v_~a$w_buff0_used~0_146 (ite .cse8 0 v_~a$w_buff0_used~0_146)))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 v_~__unbuffered_p3_EAX~0_20)))))) InVars {~a~0=v_~a~0_77, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_76, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_146, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_75, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_145, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_36, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~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, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][53], [P2Thread1of1ForFork0InUse, 37#L835true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), Black: 93#(= ~z~0 0), 107#true, Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, 25#P0EXITtrue, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 28#L871true, Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 84#(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))), 46#L789true, P1Thread1of1ForFork3InUse, Black: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:50,937 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-01-31 17:39:50,937 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:39:50,937 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:39:50,937 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:39:50,944 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L819-->L835: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_76 256) 0)) (.cse9 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_146 256) 0)) (.cse1 (and .cse9 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse9 .cse5))) (let ((.cse6 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_145 256) 0)) (.cse7 (or .cse11 .cse1 .cse2)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0)))) (and (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_50) (= (ite .cse0 v_~a$r_buff1_thd4~0_76 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse4 .cse5) .cse3 (and .cse4 .cse6))) v_~a$r_buff1_thd4~0_76 0)) v_~a$r_buff1_thd4~0_75) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_77 v_~a$mem_tmp~0_20) (= (ite .cse7 v_~a~0_77 (ite .cse8 v_~a$w_buff0~0_51 v_~a$w_buff1~0_50)) v_~__unbuffered_p3_EAX~0_20) (= (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or (and .cse9 .cse6) .cse2 .cse3) v_~a$r_buff0_thd4~0_76 (ite (and (not .cse3) .cse10) 0 v_~a$r_buff0_thd4~0_76))) v_~a$r_buff0_thd4~0_75) (= v_~a$w_buff0_used~0_145 (ite .cse0 v_~a$w_buff0_used~0_146 (ite .cse7 v_~a$w_buff0_used~0_146 (ite .cse8 0 v_~a$w_buff0_used~0_146)))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 v_~__unbuffered_p3_EAX~0_20)))))) InVars {~a~0=v_~a~0_77, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_76, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_146, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_75, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_145, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_36, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~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, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][53], [P2Thread1of1ForFork0InUse, 30#L769true, 37#L835true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 107#true, Black: 93#(= ~z~0 0), Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, 17#L877true, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 84#(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: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 46#L789true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:50,944 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-01-31 17:39:50,944 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-31 17:39:50,945 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-31 17:39:50,945 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-31 17:39:51,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L819-->L835: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_76 256) 0)) (.cse9 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_146 256) 0)) (.cse1 (and .cse9 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse9 .cse5))) (let ((.cse6 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_145 256) 0)) (.cse7 (or .cse11 .cse1 .cse2)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0)))) (and (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_50) (= (ite .cse0 v_~a$r_buff1_thd4~0_76 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse4 .cse5) .cse3 (and .cse4 .cse6))) v_~a$r_buff1_thd4~0_76 0)) v_~a$r_buff1_thd4~0_75) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_77 v_~a$mem_tmp~0_20) (= (ite .cse7 v_~a~0_77 (ite .cse8 v_~a$w_buff0~0_51 v_~a$w_buff1~0_50)) v_~__unbuffered_p3_EAX~0_20) (= (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or (and .cse9 .cse6) .cse2 .cse3) v_~a$r_buff0_thd4~0_76 (ite (and (not .cse3) .cse10) 0 v_~a$r_buff0_thd4~0_76))) v_~a$r_buff0_thd4~0_75) (= v_~a$w_buff0_used~0_145 (ite .cse0 v_~a$w_buff0_used~0_146 (ite .cse7 v_~a$w_buff0_used~0_146 (ite .cse8 0 v_~a$w_buff0_used~0_146)))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 v_~__unbuffered_p3_EAX~0_20)))))) InVars {~a~0=v_~a~0_77, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_76, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_146, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_75, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_145, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_36, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~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, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][53], [P2Thread1of1ForFork0InUse, 37#L835true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 107#true, Black: 93#(= ~z~0 0), Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, 25#P0EXITtrue, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 35#L867true, 31#P1EXITtrue, Black: 84#(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))), P1Thread1of1ForFork3InUse, Black: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:51,001 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-01-31 17:39:51,001 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:39:51,001 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:39:51,001 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:39:51,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L819-->L835: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_76 256) 0)) (.cse9 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_146 256) 0)) (.cse1 (and .cse9 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse9 .cse5))) (let ((.cse6 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_145 256) 0)) (.cse7 (or .cse11 .cse1 .cse2)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0)))) (and (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_50) (= (ite .cse0 v_~a$r_buff1_thd4~0_76 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse4 .cse5) .cse3 (and .cse4 .cse6))) v_~a$r_buff1_thd4~0_76 0)) v_~a$r_buff1_thd4~0_75) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_77 v_~a$mem_tmp~0_20) (= (ite .cse7 v_~a~0_77 (ite .cse8 v_~a$w_buff0~0_51 v_~a$w_buff1~0_50)) v_~__unbuffered_p3_EAX~0_20) (= (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or (and .cse9 .cse6) .cse2 .cse3) v_~a$r_buff0_thd4~0_76 (ite (and (not .cse3) .cse10) 0 v_~a$r_buff0_thd4~0_76))) v_~a$r_buff0_thd4~0_75) (= v_~a$w_buff0_used~0_145 (ite .cse0 v_~a$w_buff0_used~0_146 (ite .cse7 v_~a$w_buff0_used~0_146 (ite .cse8 0 v_~a$w_buff0_used~0_146)))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 v_~__unbuffered_p3_EAX~0_20)))))) InVars {~a~0=v_~a~0_77, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_76, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_146, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_75, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_145, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_36, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~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, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][53], [P2Thread1of1ForFork0InUse, 37#L835true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 107#true, Black: 93#(= ~z~0 0), Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, 25#P0EXITtrue, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 31#P1EXITtrue, Black: 84#(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))), P1Thread1of1ForFork3InUse, Black: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 19#L866-3true, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:51,002 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-01-31 17:39:51,002 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-31 17:39:51,002 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-31 17:39:51,002 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-31 17:39:51,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L819-->L835: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_76 256) 0)) (.cse9 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_146 256) 0)) (.cse1 (and .cse9 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse9 .cse5))) (let ((.cse6 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_145 256) 0)) (.cse7 (or .cse11 .cse1 .cse2)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0)))) (and (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_50) (= (ite .cse0 v_~a$r_buff1_thd4~0_76 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse4 .cse5) .cse3 (and .cse4 .cse6))) v_~a$r_buff1_thd4~0_76 0)) v_~a$r_buff1_thd4~0_75) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_77 v_~a$mem_tmp~0_20) (= (ite .cse7 v_~a~0_77 (ite .cse8 v_~a$w_buff0~0_51 v_~a$w_buff1~0_50)) v_~__unbuffered_p3_EAX~0_20) (= (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or (and .cse9 .cse6) .cse2 .cse3) v_~a$r_buff0_thd4~0_76 (ite (and (not .cse3) .cse10) 0 v_~a$r_buff0_thd4~0_76))) v_~a$r_buff0_thd4~0_75) (= v_~a$w_buff0_used~0_145 (ite .cse0 v_~a$w_buff0_used~0_146 (ite .cse7 v_~a$w_buff0_used~0_146 (ite .cse8 0 v_~a$w_buff0_used~0_146)))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 v_~__unbuffered_p3_EAX~0_20)))))) InVars {~a~0=v_~a~0_77, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_76, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_146, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_75, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_145, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_36, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~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, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][53], [P2Thread1of1ForFork0InUse, 30#L769true, 37#L835true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), Black: 93#(= ~z~0 0), 107#true, Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 28#L871true, Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 31#P1EXITtrue, Black: 84#(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: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:51,120 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-01-31 17:39:51,120 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:39:51,120 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:39:51,120 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-31 17:39:51,121 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L819-->L835: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_76 256) 0)) (.cse9 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_146 256) 0)) (.cse1 (and .cse9 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse9 .cse5))) (let ((.cse6 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_145 256) 0)) (.cse7 (or .cse11 .cse1 .cse2)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0)))) (and (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_50) (= (ite .cse0 v_~a$r_buff1_thd4~0_76 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse4 .cse5) .cse3 (and .cse4 .cse6))) v_~a$r_buff1_thd4~0_76 0)) v_~a$r_buff1_thd4~0_75) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_77 v_~a$mem_tmp~0_20) (= (ite .cse7 v_~a~0_77 (ite .cse8 v_~a$w_buff0~0_51 v_~a$w_buff1~0_50)) v_~__unbuffered_p3_EAX~0_20) (= (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or (and .cse9 .cse6) .cse2 .cse3) v_~a$r_buff0_thd4~0_76 (ite (and (not .cse3) .cse10) 0 v_~a$r_buff0_thd4~0_76))) v_~a$r_buff0_thd4~0_75) (= v_~a$w_buff0_used~0_145 (ite .cse0 v_~a$w_buff0_used~0_146 (ite .cse7 v_~a$w_buff0_used~0_146 (ite .cse8 0 v_~a$w_buff0_used~0_146)))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 v_~__unbuffered_p3_EAX~0_20)))))) InVars {~a~0=v_~a~0_77, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_76, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_146, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_75, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_145, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_36, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~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, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][53], [P2Thread1of1ForFork0InUse, 37#L835true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), Black: 93#(= ~z~0 0), 107#true, Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, 17#L877true, 25#P0EXITtrue, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 84#(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))), 46#L789true, P1Thread1of1ForFork3InUse, Black: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:51,121 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-01-31 17:39:51,122 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:39:51,122 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:39:51,122 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:39:51,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L877-->L880: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EAX~0_3 0) (= 2 v_~z~0_4) (= 2 v_~x~0_4))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~z~0=v_~z~0_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__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_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][71], [P2Thread1of1ForFork0InUse, 30#L769true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 32#L880true, Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), Black: 93#(= ~z~0 0), 107#true, Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, 4#L819true, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 84#(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))), 46#L789true, P1Thread1of1ForFork3InUse, Black: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:51,122 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is not cut-off event [2024-01-31 17:39:51,122 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-01-31 17:39:51,122 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-01-31 17:39:51,123 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-01-31 17:39:51,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L819-->L835: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_76 256) 0)) (.cse9 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_146 256) 0)) (.cse1 (and .cse9 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse9 .cse5))) (let ((.cse6 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_145 256) 0)) (.cse7 (or .cse11 .cse1 .cse2)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0)))) (and (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_50) (= (ite .cse0 v_~a$r_buff1_thd4~0_76 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse4 .cse5) .cse3 (and .cse4 .cse6))) v_~a$r_buff1_thd4~0_76 0)) v_~a$r_buff1_thd4~0_75) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_77 v_~a$mem_tmp~0_20) (= (ite .cse7 v_~a~0_77 (ite .cse8 v_~a$w_buff0~0_51 v_~a$w_buff1~0_50)) v_~__unbuffered_p3_EAX~0_20) (= (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or (and .cse9 .cse6) .cse2 .cse3) v_~a$r_buff0_thd4~0_76 (ite (and (not .cse3) .cse10) 0 v_~a$r_buff0_thd4~0_76))) v_~a$r_buff0_thd4~0_75) (= v_~a$w_buff0_used~0_145 (ite .cse0 v_~a$w_buff0_used~0_146 (ite .cse7 v_~a$w_buff0_used~0_146 (ite .cse8 0 v_~a$w_buff0_used~0_146)))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 v_~__unbuffered_p3_EAX~0_20)))))) InVars {~a~0=v_~a~0_77, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_76, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_146, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_75, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_145, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_36, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~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, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][53], [P2Thread1of1ForFork0InUse, 37#L835true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), Black: 93#(= ~z~0 0), 107#true, Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, 25#P0EXITtrue, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 28#L871true, Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 31#P1EXITtrue, Black: 84#(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))), P1Thread1of1ForFork3InUse, Black: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:51,321 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-01-31 17:39:51,321 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-31 17:39:51,321 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-31 17:39:51,321 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-31 17:39:51,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L819-->L835: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_76 256) 0)) (.cse9 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_146 256) 0)) (.cse1 (and .cse9 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse9 .cse5))) (let ((.cse6 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_145 256) 0)) (.cse7 (or .cse11 .cse1 .cse2)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0)))) (and (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_50) (= (ite .cse0 v_~a$r_buff1_thd4~0_76 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse4 .cse5) .cse3 (and .cse4 .cse6))) v_~a$r_buff1_thd4~0_76 0)) v_~a$r_buff1_thd4~0_75) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_77 v_~a$mem_tmp~0_20) (= (ite .cse7 v_~a~0_77 (ite .cse8 v_~a$w_buff0~0_51 v_~a$w_buff1~0_50)) v_~__unbuffered_p3_EAX~0_20) (= (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or (and .cse9 .cse6) .cse2 .cse3) v_~a$r_buff0_thd4~0_76 (ite (and (not .cse3) .cse10) 0 v_~a$r_buff0_thd4~0_76))) v_~a$r_buff0_thd4~0_75) (= v_~a$w_buff0_used~0_145 (ite .cse0 v_~a$w_buff0_used~0_146 (ite .cse7 v_~a$w_buff0_used~0_146 (ite .cse8 0 v_~a$w_buff0_used~0_146)))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 v_~__unbuffered_p3_EAX~0_20)))))) InVars {~a~0=v_~a~0_77, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_76, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_146, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_75, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_145, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_36, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~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, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][53], [P2Thread1of1ForFork0InUse, 30#L769true, 37#L835true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 107#true, Black: 93#(= ~z~0 0), Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, 17#L877true, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 84#(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))), 31#P1EXITtrue, Black: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:51,322 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-01-31 17:39:51,322 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:39:51,322 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:39:51,331 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 17:39:51,701 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L877-->L880: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EAX~0_3 0) (= 2 v_~z~0_4) (= 2 v_~x~0_4))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~z~0=v_~z~0_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__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_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][71], [P2Thread1of1ForFork0InUse, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 32#L880true, Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), Black: 93#(= ~z~0 0), 107#true, Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, 25#P0EXITtrue, 4#L819true, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 84#(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))), 46#L789true, P1Thread1of1ForFork3InUse, Black: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:51,720 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-01-31 17:39:51,720 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:39:51,720 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:39:51,720 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:39:51,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L819-->L835: Formula: (let ((.cse5 (= (mod v_~a$r_buff1_thd4~0_76 256) 0)) (.cse9 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_146 256) 0)) (.cse1 (and .cse9 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse9 .cse5))) (let ((.cse6 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_145 256) 0)) (.cse7 (or .cse11 .cse1 .cse2)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0)))) (and (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= v_~a$w_buff1~0_49 v_~a$w_buff1~0_50) (= (ite .cse0 v_~a$r_buff1_thd4~0_76 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse4 .cse5) .cse3 (and .cse4 .cse6))) v_~a$r_buff1_thd4~0_76 0)) v_~a$r_buff1_thd4~0_75) (= v_~a$flush_delayed~0_21 0) (= v_~a~0_77 v_~a$mem_tmp~0_20) (= (ite .cse7 v_~a~0_77 (ite .cse8 v_~a$w_buff0~0_51 v_~a$w_buff1~0_50)) v_~__unbuffered_p3_EAX~0_20) (= (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or (and .cse9 .cse6) .cse2 .cse3) v_~a$r_buff0_thd4~0_76 (ite (and (not .cse3) .cse10) 0 v_~a$r_buff0_thd4~0_76))) v_~a$r_buff0_thd4~0_75) (= v_~a$w_buff0_used~0_145 (ite .cse0 v_~a$w_buff0_used~0_146 (ite .cse7 v_~a$w_buff0_used~0_146 (ite .cse8 0 v_~a$w_buff0_used~0_146)))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= v_~a~0_76 (ite .cse0 v_~a$mem_tmp~0_20 v_~__unbuffered_p3_EAX~0_20)))))) InVars {~a~0=v_~a~0_77, ~a$w_buff1~0=v_~a$w_buff1~0_50, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_76, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_146, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_75, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_145, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_76, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_49, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_36, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~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, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][53], [P2Thread1of1ForFork0InUse, 37#L835true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 107#true, Black: 93#(= ~z~0 0), Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, 17#L877true, 25#P0EXITtrue, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 84#(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))), 31#P1EXITtrue, Black: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:51,764 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-01-31 17:39:51,764 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-31 17:39:51,764 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-31 17:39:51,764 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-31 17:39:51,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L877-->L880: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EAX~0_3 0) (= 2 v_~z~0_4) (= 2 v_~x~0_4))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~z~0=v_~z~0_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__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_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][71], [P2Thread1of1ForFork0InUse, 30#L769true, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 32#L880true, Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), Black: 93#(= ~z~0 0), 107#true, Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, 4#L819true, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 84#(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))), 31#P1EXITtrue, P1Thread1of1ForFork3InUse, Black: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:51,765 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-01-31 17:39:51,765 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:39:51,765 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:39:51,765 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-01-31 17:39:52,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L877-->L880: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EAX~0_3 0) (= 2 v_~z~0_4) (= 2 v_~x~0_4))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~z~0=v_~z~0_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__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_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][71], [P2Thread1of1ForFork0InUse, Black: 101#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 32#L880true, Black: 99#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), Black: 93#(= ~z~0 0), 107#true, Black: 97#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 66#true, Black: 94#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 91#true, 36#L802true, 4#L819true, 25#P0EXITtrue, Black: 77#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 80#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 76#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 84#(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))), 31#P1EXITtrue, P1Thread1of1ForFork3InUse, Black: 82#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse]) [2024-01-31 17:39:52,139 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is not cut-off event [2024-01-31 17:39:52,139 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-01-31 17:39:52,140 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-01-31 17:39:52,140 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-01-31 17:39:52,672 INFO L124 PetriNetUnfolderBase]: 20844/31934 cut-off events. [2024-01-31 17:39:52,673 INFO L125 PetriNetUnfolderBase]: For 48587/49334 co-relation queries the response was YES. [2024-01-31 17:39:52,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88849 conditions, 31934 events. 20844/31934 cut-off events. For 48587/49334 co-relation queries the response was YES. Maximal size of possible extension queue 1594. Compared 249368 event pairs, 9240 based on Foata normal form. 852/31932 useless extension candidates. Maximal degree in co-relation 88835. Up to 22094 conditions per place. [2024-01-31 17:39:52,891 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 45 selfloop transitions, 5 changer transitions 55/126 dead transitions. [2024-01-31 17:39:52,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 126 transitions, 742 flow [2024-01-31 17:39:52,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:39:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:39:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2024-01-31 17:39:52,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6022408963585434 [2024-01-31 17:39:52,893 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 236 flow. Second operand 7 states and 215 transitions. [2024-01-31 17:39:52,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 126 transitions, 742 flow [2024-01-31 17:39:53,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 126 transitions, 729 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-01-31 17:39:53,025 INFO L231 Difference]: Finished difference. Result has 73 places, 55 transitions, 300 flow [2024-01-31 17:39:53,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=73, PETRI_TRANSITIONS=55} [2024-01-31 17:39:53,030 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 14 predicate places. [2024-01-31 17:39:53,030 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 300 flow [2024-01-31 17:39:53,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-31 17:39:53,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:53,031 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-31 17:39:53,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 17:39:53,031 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:53,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:53,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1028783035, now seen corresponding path program 1 times [2024-01-31 17:39:53,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:53,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71478055] [2024-01-31 17:39:53,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:53,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:53,156 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-31 17:39:53,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:53,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71478055] [2024-01-31 17:39:53,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71478055] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:53,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:53,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:39:53,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288494570] [2024-01-31 17:39:53,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:53,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:39:53,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:53,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:39:53,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:39:53,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 51 [2024-01-31 17:39:53,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 55 transitions, 300 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-31 17:39:53,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:53,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 51 [2024-01-31 17:39:53,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:57,265 INFO L124 PetriNetUnfolderBase]: 30850/48261 cut-off events. [2024-01-31 17:39:57,266 INFO L125 PetriNetUnfolderBase]: For 68397/75111 co-relation queries the response was YES. [2024-01-31 17:39:57,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126106 conditions, 48261 events. 30850/48261 cut-off events. For 68397/75111 co-relation queries the response was YES. Maximal size of possible extension queue 2080. Compared 390787 event pairs, 5282 based on Foata normal form. 1843/48783 useless extension candidates. Maximal degree in co-relation 126089. Up to 22988 conditions per place. [2024-01-31 17:39:57,705 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 56 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2024-01-31 17:39:57,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 89 transitions, 514 flow [2024-01-31 17:39:57,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:39:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:39:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-01-31 17:39:57,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2024-01-31 17:39:57,707 INFO L175 Difference]: Start difference. First operand has 73 places, 55 transitions, 300 flow. Second operand 4 states and 141 transitions. [2024-01-31 17:39:57,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 89 transitions, 514 flow [2024-01-31 17:39:58,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 89 transitions, 505 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-01-31 17:39:58,024 INFO L231 Difference]: Finished difference. Result has 71 places, 60 transitions, 337 flow [2024-01-31 17:39:58,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=337, PETRI_PLACES=71, PETRI_TRANSITIONS=60} [2024-01-31 17:39:58,026 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 12 predicate places. [2024-01-31 17:39:58,026 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 60 transitions, 337 flow [2024-01-31 17:39:58,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-31 17:39:58,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:58,026 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-31 17:39:58,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 17:39:58,027 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:58,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:58,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1898593285, now seen corresponding path program 1 times [2024-01-31 17:39:58,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:58,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700238833] [2024-01-31 17:39:58,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:58,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:58,152 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-31 17:39:58,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:58,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700238833] [2024-01-31 17:39:58,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700238833] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:58,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:58,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:39:58,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338900725] [2024-01-31 17:39:58,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:58,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:39:58,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:58,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:39:58,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:39:58,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2024-01-31 17:39:58,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 60 transitions, 337 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-31 17:39:58,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:58,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2024-01-31 17:39:58,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:40:06,522 INFO L124 PetriNetUnfolderBase]: 41420/64147 cut-off events. [2024-01-31 17:40:06,522 INFO L125 PetriNetUnfolderBase]: For 105891/109044 co-relation queries the response was YES. [2024-01-31 17:40:06,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182259 conditions, 64147 events. 41420/64147 cut-off events. For 105891/109044 co-relation queries the response was YES. Maximal size of possible extension queue 3142. Compared 554835 event pairs, 19155 based on Foata normal form. 1505/60888 useless extension candidates. Maximal degree in co-relation 182242. Up to 26404 conditions per place. [2024-01-31 17:40:06,983 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 90 selfloop transitions, 13 changer transitions 0/129 dead transitions. [2024-01-31 17:40:06,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 129 transitions, 810 flow [2024-01-31 17:40:06,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:40:06,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:40:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 218 transitions. [2024-01-31 17:40:06,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6106442577030813 [2024-01-31 17:40:06,985 INFO L175 Difference]: Start difference. First operand has 71 places, 60 transitions, 337 flow. Second operand 7 states and 218 transitions. [2024-01-31 17:40:06,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 129 transitions, 810 flow [2024-01-31 17:40:07,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 129 transitions, 796 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-01-31 17:40:07,020 INFO L231 Difference]: Finished difference. Result has 81 places, 67 transitions, 455 flow [2024-01-31 17:40:07,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=455, PETRI_PLACES=81, PETRI_TRANSITIONS=67} [2024-01-31 17:40:07,021 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 22 predicate places. [2024-01-31 17:40:07,021 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 455 flow [2024-01-31 17:40:07,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-31 17:40:07,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:40:07,021 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-31 17:40:07,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 17:40:07,021 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:40:07,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:40:07,022 INFO L85 PathProgramCache]: Analyzing trace with hash -611135657, now seen corresponding path program 1 times [2024-01-31 17:40:07,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:40:07,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75816751] [2024-01-31 17:40:07,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:40:07,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:40:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:40:07,131 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-31 17:40:07,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:40:07,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75816751] [2024-01-31 17:40:07,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75816751] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:40:07,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:40:07,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:40:07,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129339246] [2024-01-31 17:40:07,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:40:07,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:40:07,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:40:07,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:40:07,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:40:07,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51 [2024-01-31 17:40:07,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 67 transitions, 455 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-31 17:40:07,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:40:07,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51 [2024-01-31 17:40:07,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand