./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 08:07:04,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 08:07:04,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 08:07:04,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 08:07:04,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 08:07:04,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 08:07:04,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 08:07:04,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 08:07:04,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 08:07:04,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 08:07:04,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 08:07:04,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 08:07:04,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 08:07:04,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 08:07:04,776 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 08:07:04,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 08:07:04,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 08:07:04,778 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 08:07:04,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 08:07:04,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 08:07:04,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 08:07:04,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 08:07:04,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 08:07:04,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 08:07:04,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 08:07:04,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 08:07:04,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 08:07:04,781 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 08:07:04,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 08:07:04,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 08:07:04,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 08:07:04,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 08:07:04,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 08:07:04,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 08:07:04,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 08:07:04,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 08:07:04,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 08:07:04,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 08:07:04,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 08:07:04,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 08:07:04,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 08:07:04,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 08:07:04,785 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc [2024-11-12 08:07:04,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 08:07:05,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 08:07:05,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 08:07:05,003 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 08:07:05,004 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 08:07:05,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2024-11-12 08:07:06,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 08:07:06,407 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 08:07:06,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2024-11-12 08:07:06,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b48d5747a/51ce8e43c6e0456498cd240ac5e4d10b/FLAG06b55c5c9 [2024-11-12 08:07:06,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b48d5747a/51ce8e43c6e0456498cd240ac5e4d10b [2024-11-12 08:07:06,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 08:07:06,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 08:07:06,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 08:07:06,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 08:07:06,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 08:07:06,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:07:06" (1/1) ... [2024-11-12 08:07:06,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2c43b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:07:06, skipping insertion in model container [2024-11-12 08:07:06,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:07:06" (1/1) ... [2024-11-12 08:07:06,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 08:07:06,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-11-12 08:07:07,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 08:07:07,158 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 08:07:07,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-11-12 08:07:07,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 08:07:07,240 INFO L204 MainTranslator]: Completed translation [2024-11-12 08:07:07,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:07:07 WrapperNode [2024-11-12 08:07:07,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 08:07:07,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 08:07:07,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 08:07:07,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 08:07:07,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:07:07" (1/1) ... [2024-11-12 08:07:07,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:07:07" (1/1) ... [2024-11-12 08:07:07,291 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-11-12 08:07:07,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 08:07:07,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 08:07:07,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 08:07:07,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 08:07:07,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:07:07" (1/1) ... [2024-11-12 08:07:07,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:07:07" (1/1) ... [2024-11-12 08:07:07,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:07:07" (1/1) ... [2024-11-12 08:07:07,318 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 08:07:07,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:07:07" (1/1) ... [2024-11-12 08:07:07,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:07:07" (1/1) ... [2024-11-12 08:07:07,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:07:07" (1/1) ... [2024-11-12 08:07:07,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:07:07" (1/1) ... [2024-11-12 08:07:07,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:07:07" (1/1) ... [2024-11-12 08:07:07,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:07:07" (1/1) ... [2024-11-12 08:07:07,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 08:07:07,334 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 08:07:07,334 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 08:07:07,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 08:07:07,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:07:07" (1/1) ... [2024-11-12 08:07:07,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 08:07:07,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:07:07,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 08:07:07,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 08:07:07,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 08:07:07,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 08:07:07,407 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-12 08:07:07,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-12 08:07:07,407 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-12 08:07:07,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-12 08:07:07,408 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-12 08:07:07,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-12 08:07:07,408 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-12 08:07:07,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-12 08:07:07,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 08:07:07,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 08:07:07,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 08:07:07,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 08:07:07,411 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 08:07:07,526 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 08:07:07,528 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 08:07:07,849 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 08:07:07,849 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 08:07:07,993 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 08:07:07,993 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 08:07:07,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:07:07 BoogieIcfgContainer [2024-11-12 08:07:07,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 08:07:07,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 08:07:07,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 08:07:07,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 08:07:07,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:07:06" (1/3) ... [2024-11-12 08:07:07,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5288ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:07:07, skipping insertion in model container [2024-11-12 08:07:08,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:07:07" (2/3) ... [2024-11-12 08:07:08,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5288ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:07:08, skipping insertion in model container [2024-11-12 08:07:08,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:07:07" (3/3) ... [2024-11-12 08:07:08,003 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_power.oepc_pso.oepc_rmo.oepc.i [2024-11-12 08:07:08,015 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 08:07:08,016 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 08:07:08,016 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 08:07:08,065 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-12 08:07:08,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2024-11-12 08:07:08,120 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-11-12 08:07:08,121 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 08:07:08,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-11-12 08:07:08,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2024-11-12 08:07:08,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2024-11-12 08:07:08,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 08:07:08,143 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@36770f4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 08:07:08,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-12 08:07:08,147 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 08:07:08,147 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-12 08:07:08,147 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 08:07:08,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:07:08,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-12 08:07:08,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-12 08:07:08,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:07:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash 11930355, now seen corresponding path program 1 times [2024-11-12 08:07:08,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:07:08,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863249187] [2024-11-12 08:07:08,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:07:08,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:07:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:07:08,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:07:08,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:07:08,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863249187] [2024-11-12 08:07:08,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863249187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:07:08,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:07:08,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 08:07:08,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198002290] [2024-11-12 08:07:08,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:07:08,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 08:07:08,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:07:08,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 08:07:08,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 08:07:08,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 49 [2024-11-12 08:07:08,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:08,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:07:08,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 49 [2024-11-12 08:07:08,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:07:09,232 INFO L124 PetriNetUnfolderBase]: 2495/4136 cut-off events. [2024-11-12 08:07:09,232 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-12 08:07:09,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7712 conditions, 4136 events. 2495/4136 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 28519 event pairs, 443 based on Foata normal form. 135/4200 useless extension candidates. Maximal degree in co-relation 7700. Up to 2779 conditions per place. [2024-11-12 08:07:09,261 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 37 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2024-11-12 08:07:09,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 225 flow [2024-11-12 08:07:09,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 08:07:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 08:07:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-11-12 08:07:09,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7891156462585034 [2024-11-12 08:07:09,274 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 116 transitions. [2024-11-12 08:07:09,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 225 flow [2024-11-12 08:07:09,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 218 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-12 08:07:09,282 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2024-11-12 08:07:09,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-11-12 08:07:09,288 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-12 08:07:09,288 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2024-11-12 08:07:09,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:09,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:07:09,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:07:09,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 08:07:09,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-12 08:07:09,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:07:09,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1457321110, now seen corresponding path program 1 times [2024-11-12 08:07:09,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:07:09,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207105282] [2024-11-12 08:07:09,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:07:09,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:07:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:07:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:07:09,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:07:09,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207105282] [2024-11-12 08:07:09,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207105282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:07:09,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:07:09,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 08:07:09,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317183165] [2024-11-12 08:07:09,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:07:09,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 08:07:09,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:07:09,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 08:07:09,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 08:07:09,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-12 08:07:09,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:09,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:07:09,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-12 08:07:09,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:07:10,648 INFO L124 PetriNetUnfolderBase]: 7779/12167 cut-off events. [2024-11-12 08:07:10,648 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2024-11-12 08:07:10,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23583 conditions, 12167 events. 7779/12167 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 86792 event pairs, 1033 based on Foata normal form. 400/12068 useless extension candidates. Maximal degree in co-relation 23573. Up to 5841 conditions per place. [2024-11-12 08:07:10,706 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 52 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2024-11-12 08:07:10,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 288 flow [2024-11-12 08:07:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 08:07:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 08:07:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2024-11-12 08:07:10,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6989795918367347 [2024-11-12 08:07:10,709 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 4 states and 137 transitions. [2024-11-12 08:07:10,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 288 flow [2024-11-12 08:07:10,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 08:07:10,711 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 134 flow [2024-11-12 08:07:10,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-11-12 08:07:10,712 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-11-12 08:07:10,712 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 134 flow [2024-11-12 08:07:10,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:10,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:07:10,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:07:10,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 08:07:10,713 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-12 08:07:10,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:07:10,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1264106216, now seen corresponding path program 1 times [2024-11-12 08:07:10,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:07:10,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631950951] [2024-11-12 08:07:10,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:07:10,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:07:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:07:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:07:10,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:07:10,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631950951] [2024-11-12 08:07:10,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631950951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:07:10,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:07:10,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 08:07:10,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168292208] [2024-11-12 08:07:10,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:07:10,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 08:07:10,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:07:10,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 08:07:10,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 08:07:10,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-12 08:07:10,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:10,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:07:10,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-12 08:07:10,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:07:11,973 INFO L124 PetriNetUnfolderBase]: 6075/9467 cut-off events. [2024-11-12 08:07:11,973 INFO L125 PetriNetUnfolderBase]: For 2276/2276 co-relation queries the response was YES. [2024-11-12 08:07:11,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21251 conditions, 9467 events. 6075/9467 cut-off events. For 2276/2276 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 63571 event pairs, 451 based on Foata normal form. 364/9470 useless extension candidates. Maximal degree in co-relation 21239. Up to 3681 conditions per place. [2024-11-12 08:07:12,016 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 67 selfloop transitions, 10 changer transitions 1/93 dead transitions. [2024-11-12 08:07:12,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 93 transitions, 413 flow [2024-11-12 08:07:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 08:07:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 08:07:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2024-11-12 08:07:12,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2024-11-12 08:07:12,019 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 134 flow. Second operand 5 states and 175 transitions. [2024-11-12 08:07:12,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 93 transitions, 413 flow [2024-11-12 08:07:12,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 402 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-12 08:07:12,024 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 186 flow [2024-11-12 08:07:12,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-11-12 08:07:12,025 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2024-11-12 08:07:12,025 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 186 flow [2024-11-12 08:07:12,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:12,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:07:12,025 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:07:12,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 08:07:12,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-12 08:07:12,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:07:12,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1510528105, now seen corresponding path program 1 times [2024-11-12 08:07:12,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:07:12,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32722126] [2024-11-12 08:07:12,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:07:12,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:07:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:07:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:07:12,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:07:12,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32722126] [2024-11-12 08:07:12,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32722126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:07:12,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:07:12,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 08:07:12,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569714868] [2024-11-12 08:07:12,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:07:12,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 08:07:12,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:07:12,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 08:07:12,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 08:07:12,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-12 08:07:12,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:12,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:07:12,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-12 08:07:12,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:07:12,904 INFO L124 PetriNetUnfolderBase]: 4027/6115 cut-off events. [2024-11-12 08:07:12,904 INFO L125 PetriNetUnfolderBase]: For 4654/4654 co-relation queries the response was YES. [2024-11-12 08:07:12,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15565 conditions, 6115 events. 4027/6115 cut-off events. For 4654/4654 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 35758 event pairs, 289 based on Foata normal form. 244/6151 useless extension candidates. Maximal degree in co-relation 15551. Up to 1788 conditions per place. [2024-11-12 08:07:12,932 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 80 selfloop transitions, 14 changer transitions 1/110 dead transitions. [2024-11-12 08:07:12,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 110 transitions, 544 flow [2024-11-12 08:07:12,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 08:07:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 08:07:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2024-11-12 08:07:12,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.717687074829932 [2024-11-12 08:07:12,934 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 186 flow. Second operand 6 states and 211 transitions. [2024-11-12 08:07:12,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 110 transitions, 544 flow [2024-11-12 08:07:12,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 110 transitions, 514 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-12 08:07:12,958 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 236 flow [2024-11-12 08:07:12,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2024-11-12 08:07:12,960 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2024-11-12 08:07:12,960 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 236 flow [2024-11-12 08:07:12,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:12,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:07:12,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:07:12,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 08:07:12,961 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-12 08:07:12,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:07:12,962 INFO L85 PathProgramCache]: Analyzing trace with hash 157947390, now seen corresponding path program 1 times [2024-11-12 08:07:12,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:07:12,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477706380] [2024-11-12 08:07:12,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:07:12,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:07:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:07:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:07:13,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:07:13,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477706380] [2024-11-12 08:07:13,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477706380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:07:13,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:07:13,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 08:07:13,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632353569] [2024-11-12 08:07:13,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:07:13,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 08:07:13,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:07:13,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 08:07:13,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 08:07:13,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-12 08:07:13,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:13,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:07:13,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-12 08:07:13,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:07:13,719 INFO L124 PetriNetUnfolderBase]: 2863/4163 cut-off events. [2024-11-12 08:07:13,719 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES. [2024-11-12 08:07:13,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11590 conditions, 4163 events. 2863/4163 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21805 event pairs, 231 based on Foata normal form. 96/4131 useless extension candidates. Maximal degree in co-relation 11575. Up to 1316 conditions per place. [2024-11-12 08:07:13,741 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 71 selfloop transitions, 18 changer transitions 1/105 dead transitions. [2024-11-12 08:07:13,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 105 transitions, 534 flow [2024-11-12 08:07:13,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 08:07:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-12 08:07:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2024-11-12 08:07:13,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6559766763848397 [2024-11-12 08:07:13,744 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 236 flow. Second operand 7 states and 225 transitions. [2024-11-12 08:07:13,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 105 transitions, 534 flow [2024-11-12 08:07:13,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 105 transitions, 488 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-12 08:07:13,769 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 246 flow [2024-11-12 08:07:13,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-11-12 08:07:13,770 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2024-11-12 08:07:13,770 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 246 flow [2024-11-12 08:07:13,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:13,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:07:13,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:07:13,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 08:07:13,771 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-12 08:07:13,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:07:13,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1391379549, now seen corresponding path program 1 times [2024-11-12 08:07:13,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:07:13,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278648256] [2024-11-12 08:07:13,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:07:13,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:07:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:07:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:07:15,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:07:15,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278648256] [2024-11-12 08:07:15,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278648256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:07:15,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:07:15,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 08:07:15,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858668496] [2024-11-12 08:07:15,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:07:15,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 08:07:15,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:07:15,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 08:07:15,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-12 08:07:15,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-11-12 08:07:15,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 246 flow. Second operand has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:15,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:07:15,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-11-12 08:07:15,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:07:17,199 INFO L124 PetriNetUnfolderBase]: 13381/20137 cut-off events. [2024-11-12 08:07:17,199 INFO L125 PetriNetUnfolderBase]: For 7917/8283 co-relation queries the response was YES. [2024-11-12 08:07:17,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46734 conditions, 20137 events. 13381/20137 cut-off events. For 7917/8283 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 136631 event pairs, 945 based on Foata normal form. 16/19523 useless extension candidates. Maximal degree in co-relation 46718. Up to 3448 conditions per place. [2024-11-12 08:07:17,329 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 117 selfloop transitions, 35 changer transitions 14/190 dead transitions. [2024-11-12 08:07:17,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 190 transitions, 904 flow [2024-11-12 08:07:17,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 08:07:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 08:07:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 343 transitions. [2024-11-12 08:07:17,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-11-12 08:07:17,331 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 246 flow. Second operand 11 states and 343 transitions. [2024-11-12 08:07:17,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 190 transitions, 904 flow [2024-11-12 08:07:17,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 190 transitions, 778 flow, removed 32 selfloop flow, removed 10 redundant places. [2024-11-12 08:07:17,579 INFO L231 Difference]: Finished difference. Result has 75 places, 90 transitions, 421 flow [2024-11-12 08:07:17,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=421, PETRI_PLACES=75, PETRI_TRANSITIONS=90} [2024-11-12 08:07:17,581 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 18 predicate places. [2024-11-12 08:07:17,581 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 90 transitions, 421 flow [2024-11-12 08:07:17,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:17,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:07:17,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:07:17,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 08:07:17,582 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-12 08:07:17,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:07:17,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1661637211, now seen corresponding path program 2 times [2024-11-12 08:07:17,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:07:17,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330071057] [2024-11-12 08:07:17,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:07:17,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:07:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:07:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:07:17,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:07:17,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330071057] [2024-11-12 08:07:17,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330071057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:07:17,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:07:17,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 08:07:17,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138358588] [2024-11-12 08:07:17,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:07:17,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 08:07:17,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:07:17,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 08:07:17,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 08:07:17,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-11-12 08:07:17,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 90 transitions, 421 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:17,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:07:17,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-11-12 08:07:17,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:07:20,182 INFO L124 PetriNetUnfolderBase]: 20147/30667 cut-off events. [2024-11-12 08:07:20,183 INFO L125 PetriNetUnfolderBase]: For 30312/30355 co-relation queries the response was YES. [2024-11-12 08:07:20,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85599 conditions, 30667 events. 20147/30667 cut-off events. For 30312/30355 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 227533 event pairs, 4473 based on Foata normal form. 26/29264 useless extension candidates. Maximal degree in co-relation 85579. Up to 11170 conditions per place. [2024-11-12 08:07:20,401 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 88 selfloop transitions, 33 changer transitions 24/169 dead transitions. [2024-11-12 08:07:20,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 169 transitions, 1068 flow [2024-11-12 08:07:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 08:07:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 08:07:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2024-11-12 08:07:20,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6156462585034014 [2024-11-12 08:07:20,403 INFO L175 Difference]: Start difference. First operand has 75 places, 90 transitions, 421 flow. Second operand 6 states and 181 transitions. [2024-11-12 08:07:20,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 169 transitions, 1068 flow [2024-11-12 08:07:20,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 169 transitions, 1062 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-12 08:07:20,635 INFO L231 Difference]: Finished difference. Result has 81 places, 109 transitions, 694 flow [2024-11-12 08:07:20,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=694, PETRI_PLACES=81, PETRI_TRANSITIONS=109} [2024-11-12 08:07:20,636 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2024-11-12 08:07:20,636 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 109 transitions, 694 flow [2024-11-12 08:07:20,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:20,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:07:20,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:07:20,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 08:07:20,638 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-12 08:07:20,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:07:20,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1956208359, now seen corresponding path program 3 times [2024-11-12 08:07:20,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:07:20,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933462023] [2024-11-12 08:07:20,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:07:20,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:07:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:07:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:07:20,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:07:20,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933462023] [2024-11-12 08:07:20,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933462023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:07:20,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:07:20,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 08:07:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336769990] [2024-11-12 08:07:20,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:07:20,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 08:07:20,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:07:20,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 08:07:20,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 08:07:21,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-11-12 08:07:21,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 109 transitions, 694 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:21,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:07:21,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-11-12 08:07:21,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:07:25,058 INFO L124 PetriNetUnfolderBase]: 27113/40849 cut-off events. [2024-11-12 08:07:25,058 INFO L125 PetriNetUnfolderBase]: For 61245/61248 co-relation queries the response was YES. [2024-11-12 08:07:25,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121462 conditions, 40849 events. 27113/40849 cut-off events. For 61245/61248 co-relation queries the response was YES. Maximal size of possible extension queue 2287. Compared 309548 event pairs, 3317 based on Foata normal form. 16/39007 useless extension candidates. Maximal degree in co-relation 121437. Up to 18491 conditions per place. [2024-11-12 08:07:25,327 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 75 selfloop transitions, 43 changer transitions 54/195 dead transitions. [2024-11-12 08:07:25,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 195 transitions, 1545 flow [2024-11-12 08:07:25,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 08:07:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-12 08:07:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2024-11-12 08:07:25,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5743440233236151 [2024-11-12 08:07:25,328 INFO L175 Difference]: Start difference. First operand has 81 places, 109 transitions, 694 flow. Second operand 7 states and 197 transitions. [2024-11-12 08:07:25,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 195 transitions, 1545 flow [2024-11-12 08:07:25,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 195 transitions, 1539 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-12 08:07:25,617 INFO L231 Difference]: Finished difference. Result has 88 places, 109 transitions, 887 flow [2024-11-12 08:07:25,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=887, PETRI_PLACES=88, PETRI_TRANSITIONS=109} [2024-11-12 08:07:25,619 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2024-11-12 08:07:25,620 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 109 transitions, 887 flow [2024-11-12 08:07:25,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:25,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:07:25,620 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:07:25,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 08:07:25,620 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-12 08:07:25,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:07:25,624 INFO L85 PathProgramCache]: Analyzing trace with hash 343727913, now seen corresponding path program 4 times [2024-11-12 08:07:25,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:07:25,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410360580] [2024-11-12 08:07:25,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:07:25,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:07:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:07:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:07:26,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:07:26,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410360580] [2024-11-12 08:07:26,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410360580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:07:26,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:07:26,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 08:07:26,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189655161] [2024-11-12 08:07:26,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:07:26,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 08:07:26,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:07:26,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 08:07:26,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 08:07:26,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-11-12 08:07:26,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 109 transitions, 887 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:26,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:07:26,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-11-12 08:07:26,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:07:26,750 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L761-->L764: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][98], [130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 60#true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 56#true, Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 54#L821true, 81#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 181#(= ~x~0 1), 7#L804true, 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 58#true, Black: 146#true, Black: 148#(= ~y~0 1), 14#L872true, 62#true, 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 36#L764true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 38#L791true, Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(= ~z~0 1)]) [2024-11-12 08:07:26,750 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-11-12 08:07:26,750 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-12 08:07:26,750 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-12 08:07:26,750 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-12 08:07:26,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L761-->L764: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][74], [60#true, 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 42#L801true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 56#true, Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 54#L821true, 81#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 181#(= ~x~0 1), 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 58#true, Black: 146#true, Black: 148#(= ~y~0 1), 14#L872true, 62#true, 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 36#L764true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 38#L791true, Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(= ~z~0 1)]) [2024-11-12 08:07:26,751 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-12 08:07:26,751 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-12 08:07:26,751 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-12 08:07:26,751 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-12 08:07:26,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][39], [60#true, 20#L761true, 56#true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 54#L821true, Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 81#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 58#true, Black: 148#(= ~y~0 1), Black: 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 26#L811true, 14#L872true, 62#true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 146#true, 38#L791true, Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(= ~z~0 1), 179#true]) [2024-11-12 08:07:26,926 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-11-12 08:07:26,926 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-12 08:07:26,926 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-12 08:07:26,926 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-12 08:07:27,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse3 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse5 (not .cse3)) (.cse13 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse4 (and .cse3 .cse8)) (.cse6 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse3))) (let ((.cse10 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse11 (or .cse13 .cse4 .cse6)) (.cse12 (and .cse5 (not .cse13)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse2 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse9 (ite .cse11 v_~a~0_74 (ite .cse12 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48))) (.cse0 (not .cse10))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (or (= |v_P3_#t~nondet4_25| 1) (= |v_P3_#t~nondet4_25| 0)) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_61 (ite (= (mod (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~a$r_buff0_thd4~0_62 (ite (and .cse5 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) 256) 0) 0 1)) (= v_~weak$$choice0~0_15 (ite (= (mod |v_P3_#t~nondet3_35| 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet4_25| 256) 0) 0 1) v_~weak$$choice2~0_30) (= (ite (= (mod (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse4 .cse6) v_~a$w_buff1_used~0_125 0)) 256) 0) 0 1) v_~a$w_buff1_used~0_124) (or (= |v_P3_#t~nondet3_35| 0) (= |v_P3_#t~nondet3_35| 1)) (= (ite (= (mod (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse2))) v_~a$r_buff1_thd4~0_60 0)) 256) 0) 0 1) v_~a$r_buff1_thd4~0_59) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse9 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite (not (= (mod (ite .cse10 0 1) 256) 0)) v_~a$mem_tmp~0_18 .cse9)) (= v_~a$w_buff0_used~0_137 (ite (= (mod (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse11 v_~a$w_buff0_used~0_138 (ite .cse12 0 v_~a$w_buff0_used~0_138))) 256) 0) 0 1))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_15, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_35|, |v_P3_#t~nondet4_25|] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][73], [60#true, 20#L761true, 33#L840true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 56#true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 81#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 7#L804true, 58#true, Black: 148#(= ~y~0 1), Black: 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 14#L872true, 62#true, 117#true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 146#true, 38#L791true, Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), 179#true, 163#(= ~z~0 1)]) [2024-11-12 08:07:27,236 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-11-12 08:07:27,236 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-12 08:07:27,236 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-12 08:07:27,236 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-12 08:07:27,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L761-->L764: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][98], [60#true, 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 30#P1EXITtrue, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 56#true, Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 54#L821true, Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 181#(= ~x~0 1), 7#L804true, 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 58#true, Black: 146#true, Black: 148#(= ~y~0 1), 14#L872true, 62#true, 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 36#L764true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(= ~z~0 1)]) [2024-11-12 08:07:27,393 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-12 08:07:27,393 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-12 08:07:27,393 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-12 08:07:27,393 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-12 08:07:27,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_95 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_85 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_96 256) 0))))) (and (= (ite (= (mod (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_85) 256) 0) 0 1) v_~a$w_buff1_used~0_84) (= v_~a$r_buff0_thd3~0_29 (ite (= (mod (ite .cse1 0 v_~a$r_buff0_thd3~0_30) 256) 0) 0 1)) (= v_~a~0_30 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse0 v_~a$w_buff1~0_19 v_~a~0_31))) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_29 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_28) 256) 0) 0 1) v_~a$r_buff1_thd3~0_27) (= v_~a$w_buff0_used~0_95 (ite (= (mod (ite .cse2 0 v_~a$w_buff0_used~0_96) 256) 0) 0 1))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_28, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_96, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_85} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_27, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_95, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_29, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_84} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][39], [60#true, 30#P1EXITtrue, 20#L761true, 56#true, Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 54#L821true, Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 58#true, Black: 148#(= ~y~0 1), Black: 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 26#L811true, 14#L872true, 62#true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 146#true, Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(= ~z~0 1), 179#true]) [2024-11-12 08:07:27,393 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-12 08:07:27,393 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-12 08:07:27,394 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-12 08:07:27,394 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-12 08:07:27,394 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L761-->L764: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][74], [60#true, 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 30#P1EXITtrue, 42#L801true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 56#true, Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 54#L821true, Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 181#(= ~x~0 1), 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 58#true, Black: 146#true, Black: 148#(= ~y~0 1), 14#L872true, 62#true, 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 36#L764true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(= ~z~0 1)]) [2024-11-12 08:07:27,394 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-11-12 08:07:27,394 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-12 08:07:27,394 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-12 08:07:27,394 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-12 08:07:27,553 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L761-->L764: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][74], [130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 60#true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 47#L824true, 56#true, Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 81#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 181#(= ~x~0 1), 7#L804true, 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 58#true, Black: 146#true, Black: 148#(= ~y~0 1), 14#L872true, 62#true, 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 36#L764true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 38#L791true, Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(= ~z~0 1)]) [2024-11-12 08:07:27,553 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2024-11-12 08:07:27,553 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-12 08:07:27,553 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-12 08:07:27,553 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-12 08:07:27,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse3 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse5 (not .cse3)) (.cse13 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse4 (and .cse3 .cse8)) (.cse6 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse3))) (let ((.cse10 (= (mod v_~weak$$choice2~0_30 256) 0)) (.cse11 (or .cse13 .cse4 .cse6)) (.cse12 (and .cse5 (not .cse13)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse2 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse9 (ite .cse11 v_~a~0_74 (ite .cse12 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48))) (.cse0 (not .cse10))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (or (= |v_P3_#t~nondet4_25| 1) (= |v_P3_#t~nondet4_25| 0)) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_61 (ite (= (mod (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~a$r_buff0_thd4~0_62 (ite (and .cse5 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) 256) 0) 0 1)) (= v_~weak$$choice0~0_15 (ite (= (mod |v_P3_#t~nondet3_35| 256) 0) 0 1)) (= (ite (= (mod |v_P3_#t~nondet4_25| 256) 0) 0 1) v_~weak$$choice2~0_30) (= (ite (= (mod (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse4 .cse6) v_~a$w_buff1_used~0_125 0)) 256) 0) 0 1) v_~a$w_buff1_used~0_124) (or (= |v_P3_#t~nondet3_35| 0) (= |v_P3_#t~nondet3_35| 1)) (= (ite (= (mod (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse2))) v_~a$r_buff1_thd4~0_60 0)) 256) 0) 0 1) v_~a$r_buff1_thd4~0_59) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse9 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite (not (= (mod (ite .cse10 0 1) 256) 0)) v_~a$mem_tmp~0_18 .cse9)) (= v_~a$w_buff0_used~0_137 (ite (= (mod (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse11 v_~a$w_buff0_used~0_138 (ite .cse12 0 v_~a$w_buff0_used~0_138))) 256) 0) 0 1))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_15, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_35|, |v_P3_#t~nondet4_25|] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][73], [60#true, 30#P1EXITtrue, 33#L840true, 20#L761true, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 56#true, Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 7#L804true, 58#true, Black: 148#(= ~y~0 1), Black: 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 14#L872true, 62#true, 117#true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 146#true, Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), 179#true, 163#(= ~z~0 1)]) [2024-11-12 08:07:27,624 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-12 08:07:27,624 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-12 08:07:27,624 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-12 08:07:27,625 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-12 08:07:28,233 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L761-->L764: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][74], [130#(and (not (= ~a$w_buff0~0 0)) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 60#true, 30#P1EXITtrue, Black: 120#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1)), 47#L824true, 56#true, Black: 132#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 124#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 95#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 128#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), Black: 117#true, Black: 121#(and (<= (mod ~a$w_buff0_used~0 256) 0) (<= 0 ~a$w_buff0_used~0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)), 181#(= ~x~0 1), 7#L804true, 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1)), 58#true, Black: 146#true, Black: 148#(= ~y~0 1), 14#L872true, 62#true, 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 36#L764true, Black: 171#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 173#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (= ~z~0 1) (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 163#(= ~z~0 1)]) [2024-11-12 08:07:28,233 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is not cut-off event [2024-11-12 08:07:28,234 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-11-12 08:07:28,234 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-11-12 08:07:28,234 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-11-12 08:07:30,796 INFO L124 PetriNetUnfolderBase]: 28346/45770 cut-off events. [2024-11-12 08:07:30,797 INFO L125 PetriNetUnfolderBase]: For 71551/73078 co-relation queries the response was YES. [2024-11-12 08:07:31,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130543 conditions, 45770 events. 28346/45770 cut-off events. For 71551/73078 co-relation queries the response was YES. Maximal size of possible extension queue 2974. Compared 404285 event pairs, 12343 based on Foata normal form. 341/42120 useless extension candidates. Maximal degree in co-relation 130513. Up to 18288 conditions per place. [2024-11-12 08:07:31,114 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 44 selfloop transitions, 7 changer transitions 53/148 dead transitions. [2024-11-12 08:07:31,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 148 transitions, 1266 flow [2024-11-12 08:07:31,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 08:07:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 08:07:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-12 08:07:31,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.636734693877551 [2024-11-12 08:07:31,115 INFO L175 Difference]: Start difference. First operand has 88 places, 109 transitions, 887 flow. Second operand 5 states and 156 transitions. [2024-11-12 08:07:31,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 148 transitions, 1266 flow [2024-11-12 08:07:31,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 148 transitions, 1260 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-12 08:07:31,562 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 611 flow [2024-11-12 08:07:31,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=611, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2024-11-12 08:07:31,562 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 34 predicate places. [2024-11-12 08:07:31,562 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 611 flow [2024-11-12 08:07:31,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:07:31,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:07:31,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:07:31,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 08:07:31,563 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-12 08:07:31,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:07:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash 141002287, now seen corresponding path program 5 times [2024-11-12 08:07:31,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:07:31,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331484699] [2024-11-12 08:07:31,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:07:31,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:07:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 08:07:31,636 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 08:07:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 08:07:31,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 08:07:31,741 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 08:07:31,743 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-12 08:07:31,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-12 08:07:31,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-12 08:07:31,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-12 08:07:31,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-12 08:07:31,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-12 08:07:31,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-12 08:07:31,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 08:07:31,747 INFO L421 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-11-12 08:07:31,827 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 08:07:31,827 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 08:07:31,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:07:31 BasicIcfg [2024-11-12 08:07:31,834 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 08:07:31,834 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 08:07:31,835 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 08:07:31,835 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 08:07:31,835 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:07:07" (3/4) ... [2024-11-12 08:07:31,836 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-12 08:07:31,919 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 08:07:31,919 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 08:07:31,920 INFO L158 Benchmark]: Toolchain (without parser) took 25155.55ms. Allocated memory was 190.8MB in the beginning and 8.3GB in the end (delta: 8.1GB). Free memory was 119.4MB in the beginning and 7.0GB in the end (delta: -6.9GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-12 08:07:31,920 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 125.8MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 08:07:31,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.08ms. Allocated memory is still 190.8MB. Free memory was 118.9MB in the beginning and 92.1MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-12 08:07:31,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.41ms. Allocated memory is still 190.8MB. Free memory was 92.1MB in the beginning and 89.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 08:07:31,921 INFO L158 Benchmark]: Boogie Preprocessor took 41.19ms. Allocated memory is still 190.8MB. Free memory was 89.5MB in the beginning and 85.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 08:07:31,921 INFO L158 Benchmark]: RCFGBuilder took 659.44ms. Allocated memory is still 190.8MB. Free memory was 85.8MB in the beginning and 118.3MB in the end (delta: -32.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 08:07:31,922 INFO L158 Benchmark]: TraceAbstraction took 23838.76ms. Allocated memory was 190.8MB in the beginning and 8.3GB in the end (delta: 8.1GB). Free memory was 118.3MB in the beginning and 7.0GB in the end (delta: -6.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-12 08:07:31,922 INFO L158 Benchmark]: Witness Printer took 84.91ms. Allocated memory is still 8.3GB. Free memory was 7.0GB in the beginning and 7.0GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 08:07:31,923 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.66ms. Allocated memory is still 125.8MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.08ms. Allocated memory is still 190.8MB. Free memory was 118.9MB in the beginning and 92.1MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.41ms. Allocated memory is still 190.8MB. Free memory was 92.1MB in the beginning and 89.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.19ms. Allocated memory is still 190.8MB. Free memory was 89.5MB in the beginning and 85.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 659.44ms. Allocated memory is still 190.8MB. Free memory was 85.8MB in the beginning and 118.3MB in the end (delta: -32.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 23838.76ms. Allocated memory was 190.8MB in the beginning and 8.3GB in the end (delta: 8.1GB). Free memory was 118.3MB in the beginning and 7.0GB in the end (delta: -6.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 84.91ms. Allocated memory is still 8.3GB. Free memory was 7.0GB in the beginning and 7.0GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t553; [L865] FCALL, FORK 0 pthread_create(&t553, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t553=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t554; [L867] FCALL, FORK 0 pthread_create(&t554, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t553=-3, t554=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L868] 0 pthread_t t555; [L869] FCALL, FORK 0 pthread_create(&t555, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t553=-3, t554=-2, t555=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L800] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L870] 0 pthread_t t556; [L871] FCALL, FORK 0 pthread_create(&t556, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t553=-3, t554=-2, t555=-1, t556=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L820] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L823] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t553=-3, t554=-2, t555=-1, t556=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t553=-3, t554=-2, t555=-1, t556=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t553=-3, t554=-2, t555=-1, t556=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 83 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 19.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 731 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 693 mSDsluCounter, 359 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 293 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1534 IncrementalHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 66 mSDtfsCounter, 1534 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=887occurred in iteration=8, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 1548 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-12 08:07:31,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE