/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe028_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 01:04:18,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 01:04:18,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 01:04:19,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 01:04:19,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 01:04:19,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 01:04:19,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 01:04:19,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 01:04:19,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 01:04:19,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 01:04:19,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 01:04:19,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 01:04:19,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 01:04:19,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 01:04:19,039 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 01:04:19,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 01:04:19,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 01:04:19,040 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 01:04:19,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 01:04:19,040 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 01:04:19,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 01:04:19,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 01:04:19,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 01:04:19,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 01:04:19,041 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 01:04:19,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 01:04:19,043 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 01:04:19,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 01:04:19,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 01:04:19,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 01:04:19,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 01:04:19,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 01:04:19,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 01:04:19,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 01:04:19,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 01:04:19,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 01:04:19,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 01:04:19,046 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 01:04:19,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 01:04:19,046 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 01:04:19,046 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 01:04:19,047 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.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-04 01:04:19,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 01:04:19,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 01:04:19,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 01:04:19,291 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 01:04:19,291 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 01:04:19,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe028_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i [2023-08-04 01:04:20,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 01:04:20,744 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 01:04:20,745 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe028_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i [2023-08-04 01:04:20,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/068f417ac/c0261cb516104c84b1d179e73848239c/FLAG97b333316 [2023-08-04 01:04:20,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/068f417ac/c0261cb516104c84b1d179e73848239c [2023-08-04 01:04:20,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 01:04:20,773 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 01:04:20,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 01:04:20,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 01:04:20,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 01:04:20,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 01:04:20" (1/1) ... [2023-08-04 01:04:20,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@facc0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:04:20, skipping insertion in model container [2023-08-04 01:04:20,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 01:04:20" (1/1) ... [2023-08-04 01:04:20,818 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 01:04:20,958 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe028_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i[975,988] [2023-08-04 01:04:21,109 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 01:04:21,121 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 01:04:21,135 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe028_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i[975,988] [2023-08-04 01:04:21,153 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 01:04:21,155 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 01:04:21,191 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 01:04:21,222 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 01:04:21,222 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 01:04:21,228 INFO L206 MainTranslator]: Completed translation [2023-08-04 01:04:21,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:04:21 WrapperNode [2023-08-04 01:04:21,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 01:04:21,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 01:04:21,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 01:04:21,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 01:04:21,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:04:21" (1/1) ... [2023-08-04 01:04:21,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:04:21" (1/1) ... [2023-08-04 01:04:21,293 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2023-08-04 01:04:21,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 01:04:21,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 01:04:21,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 01:04:21,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 01:04:21,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:04:21" (1/1) ... [2023-08-04 01:04:21,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:04:21" (1/1) ... [2023-08-04 01:04:21,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:04:21" (1/1) ... [2023-08-04 01:04:21,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:04:21" (1/1) ... [2023-08-04 01:04:21,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:04:21" (1/1) ... [2023-08-04 01:04:21,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:04:21" (1/1) ... [2023-08-04 01:04:21,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:04:21" (1/1) ... [2023-08-04 01:04:21,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:04:21" (1/1) ... [2023-08-04 01:04:21,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 01:04:21,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 01:04:21,347 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 01:04:21,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 01:04:21,347 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:04:21" (1/1) ... [2023-08-04 01:04:21,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 01:04:21,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:04:21,382 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 01:04:21,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 01:04:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 01:04:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 01:04:21,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 01:04:21,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 01:04:21,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 01:04:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 01:04:21,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 01:04:21,419 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 01:04:21,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 01:04:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 01:04:21,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 01:04:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 01:04:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 01:04:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 01:04:21,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 01:04:21,422 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 01:04:21,545 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 01:04:21,547 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 01:04:21,713 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 01:04:21,719 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 01:04:21,720 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 01:04:21,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 01:04:21 BoogieIcfgContainer [2023-08-04 01:04:21,722 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 01:04:21,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 01:04:21,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 01:04:21,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 01:04:21,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 01:04:20" (1/3) ... [2023-08-04 01:04:21,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2649c3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 01:04:21, skipping insertion in model container [2023-08-04 01:04:21,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:04:21" (2/3) ... [2023-08-04 01:04:21,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2649c3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 01:04:21, skipping insertion in model container [2023-08-04 01:04:21,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 01:04:21" (3/3) ... [2023-08-04 01:04:21,729 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe028_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i [2023-08-04 01:04:21,735 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 01:04:21,741 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 01:04:21,741 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 01:04:21,741 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 01:04:21,786 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 01:04:21,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 105 transitions, 225 flow [2023-08-04 01:04:21,919 INFO L124 PetriNetUnfolderBase]: 30/412 cut-off events. [2023-08-04 01:04:21,919 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:04:21,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 412 events. 30/412 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1834 event pairs, 0 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 241. Up to 16 conditions per place. [2023-08-04 01:04:21,925 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 105 transitions, 225 flow [2023-08-04 01:04:21,929 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 169 flow [2023-08-04 01:04:21,932 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:04:21,947 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 169 flow [2023-08-04 01:04:21,949 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 169 flow [2023-08-04 01:04:21,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 169 flow [2023-08-04 01:04:21,993 INFO L124 PetriNetUnfolderBase]: 6/188 cut-off events. [2023-08-04 01:04:21,993 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:04:21,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 188 events. 6/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 586 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-04 01:04:21,999 INFO L119 LiptonReduction]: Number of co-enabled transitions 1042 [2023-08-04 01:04:23,749 INFO L134 LiptonReduction]: Checked pairs total: 1779 [2023-08-04 01:04:23,749 INFO L136 LiptonReduction]: Total number of compositions: 60 [2023-08-04 01:04:23,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 01:04:23,777 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@26b1ff0d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:04:23,778 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 01:04:23,784 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:04:23,785 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-08-04 01:04:23,785 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:04:23,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:04:23,786 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 01:04:23,786 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:04:23,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:04:23,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1891808794, now seen corresponding path program 1 times [2023-08-04 01:04:23,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:04:23,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926728523] [2023-08-04 01:04:23,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:23,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:04:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:04:23,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 01:04:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:04:23,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 01:04:23,937 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 01:04:23,938 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 01:04:23,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 01:04:23,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 01:04:23,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 01:04:23,940 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 01:04:23,942 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (1/2) [2023-08-04 01:04:23,943 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 01:04:23,943 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 01:04:23,976 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 01:04:23,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 286 flow [2023-08-04 01:04:24,159 INFO L124 PetriNetUnfolderBase]: 93/1298 cut-off events. [2023-08-04 01:04:24,159 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 01:04:24,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 1298 events. 93/1298 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8843 event pairs, 0 based on Foata normal form. 0/1139 useless extension candidates. Maximal degree in co-relation 939. Up to 54 conditions per place. [2023-08-04 01:04:24,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 286 flow [2023-08-04 01:04:24,170 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 97 transitions, 230 flow [2023-08-04 01:04:24,171 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:04:24,171 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 97 transitions, 230 flow [2023-08-04 01:04:24,171 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 97 transitions, 230 flow [2023-08-04 01:04:24,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 97 transitions, 230 flow [2023-08-04 01:04:24,220 INFO L124 PetriNetUnfolderBase]: 12/542 cut-off events. [2023-08-04 01:04:24,221 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 01:04:24,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 542 events. 12/542 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2753 event pairs, 0 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 435. Up to 27 conditions per place. [2023-08-04 01:04:24,230 INFO L119 LiptonReduction]: Number of co-enabled transitions 2764 [2023-08-04 01:04:25,851 INFO L134 LiptonReduction]: Checked pairs total: 5457 [2023-08-04 01:04:25,851 INFO L136 LiptonReduction]: Total number of compositions: 66 [2023-08-04 01:04:25,853 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 01:04:25,854 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@26b1ff0d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:04:25,854 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 01:04:25,860 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:04:25,860 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2023-08-04 01:04:25,860 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-04 01:04:25,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:04:25,861 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-04 01:04:25,861 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:04:25,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:04:25,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1867301451, now seen corresponding path program 1 times [2023-08-04 01:04:25,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:04:25,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262602595] [2023-08-04 01:04:25,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:25,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:04:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 01:04:26,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:04:26,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262602595] [2023-08-04 01:04:26,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262602595] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:04:26,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:04:26,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:04:26,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297008088] [2023-08-04 01:04:26,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:04:26,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:04:26,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:04:26,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:04:26,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:04:26,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 191 [2023-08-04 01:04:26,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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) [2023-08-04 01:04:26,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:04:26,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 191 [2023-08-04 01:04:26,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:04:27,959 INFO L124 PetriNetUnfolderBase]: 12844/18542 cut-off events. [2023-08-04 01:04:27,960 INFO L125 PetriNetUnfolderBase]: For 1812/1812 co-relation queries the response was YES. [2023-08-04 01:04:28,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38229 conditions, 18542 events. 12844/18542 cut-off events. For 1812/1812 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 116865 event pairs, 9918 based on Foata normal form. 0/18310 useless extension candidates. Maximal degree in co-relation 11473. Up to 17234 conditions per place. [2023-08-04 01:04:28,191 INFO L140 encePairwiseOnDemand]: 188/191 looper letters, 28 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-08-04 01:04:28,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 176 flow [2023-08-04 01:04:28,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:04:28,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:04:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-08-04 01:04:28,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.62478184991274 [2023-08-04 01:04:28,204 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-08-04 01:04:28,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-08-04 01:04:28,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:04:28,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-08-04 01:04:28,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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) [2023-08-04 01:04:28,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 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) [2023-08-04 01:04:28,216 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 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) [2023-08-04 01:04:28,217 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 108 flow. Second operand 3 states and 358 transitions. [2023-08-04 01:04:28,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 176 flow [2023-08-04 01:04:28,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 40 transitions, 170 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-04 01:04:28,225 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 114 flow [2023-08-04 01:04:28,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-08-04 01:04:28,229 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2023-08-04 01:04:28,230 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 114 flow [2023-08-04 01:04:28,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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) [2023-08-04 01:04:28,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:04:28,230 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 01:04:28,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 01:04:28,231 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:04:28,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:04:28,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1659111623, now seen corresponding path program 1 times [2023-08-04 01:04:28,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:04:28,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227253277] [2023-08-04 01:04:28,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:28,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:04:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 01:04:28,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:04:28,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227253277] [2023-08-04 01:04:28,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227253277] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:04:28,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698200830] [2023-08-04 01:04:28,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:28,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:28,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:04:28,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:04:28,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 01:04:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:28,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 01:04:28,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:04:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 01:04:28,453 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:04:28,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698200830] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:04:28,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:04:28,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 01:04:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581513171] [2023-08-04 01:04:28,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:04:28,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:04:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:04:28,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:04:28,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 01:04:28,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 191 [2023-08-04 01:04:28,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 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) [2023-08-04 01:04:28,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:04:28,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 191 [2023-08-04 01:04:28,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:04:30,091 INFO L124 PetriNetUnfolderBase]: 12832/18497 cut-off events. [2023-08-04 01:04:30,091 INFO L125 PetriNetUnfolderBase]: For 1479/1479 co-relation queries the response was YES. [2023-08-04 01:04:30,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37899 conditions, 18497 events. 12832/18497 cut-off events. For 1479/1479 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 116479 event pairs, 7728 based on Foata normal form. 9/18325 useless extension candidates. Maximal degree in co-relation 13595. Up to 17187 conditions per place. [2023-08-04 01:04:30,205 INFO L140 encePairwiseOnDemand]: 187/191 looper letters, 31 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2023-08-04 01:04:30,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 44 transitions, 198 flow [2023-08-04 01:04:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 01:04:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 01:04:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2023-08-04 01:04:30,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6031413612565445 [2023-08-04 01:04:30,211 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 576 transitions. [2023-08-04 01:04:30,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 576 transitions. [2023-08-04 01:04:30,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:04:30,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 576 transitions. [2023-08-04 01:04:30,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 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) [2023-08-04 01:04:30,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 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) [2023-08-04 01:04:30,218 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 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) [2023-08-04 01:04:30,218 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 114 flow. Second operand 5 states and 576 transitions. [2023-08-04 01:04:30,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 44 transitions, 198 flow [2023-08-04 01:04:30,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 44 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 01:04:30,222 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 128 flow [2023-08-04 01:04:30,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2023-08-04 01:04:30,223 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2023-08-04 01:04:30,223 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 128 flow [2023-08-04 01:04:30,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 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) [2023-08-04 01:04:30,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:04:30,225 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:04:30,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 01:04:30,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:30,432 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:04:30,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:04:30,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1173059960, now seen corresponding path program 1 times [2023-08-04 01:04:30,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:04:30,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112443567] [2023-08-04 01:04:30,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:30,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:04:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 01:04:30,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:04:30,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112443567] [2023-08-04 01:04:30,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112443567] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:04:30,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426424980] [2023-08-04 01:04:30,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:30,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:30,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:04:30,502 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:04:30,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 01:04:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:30,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 01:04:30,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:04:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 01:04:30,605 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:04:30,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426424980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:04:30,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:04:30,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 01:04:30,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180353995] [2023-08-04 01:04:30,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:04:30,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:04:30,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:04:30,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:04:30,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:04:30,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 191 [2023-08-04 01:04:30,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 37 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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) [2023-08-04 01:04:30,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:04:30,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 191 [2023-08-04 01:04:30,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:04:32,007 INFO L124 PetriNetUnfolderBase]: 12242/18368 cut-off events. [2023-08-04 01:04:32,008 INFO L125 PetriNetUnfolderBase]: For 1366/1366 co-relation queries the response was YES. [2023-08-04 01:04:32,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36967 conditions, 18368 events. 12242/18368 cut-off events. For 1366/1366 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 122098 event pairs, 9508 based on Foata normal form. 0/18151 useless extension candidates. Maximal degree in co-relation 11036. Up to 16198 conditions per place. [2023-08-04 01:04:32,115 INFO L140 encePairwiseOnDemand]: 188/191 looper letters, 33 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2023-08-04 01:04:32,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 216 flow [2023-08-04 01:04:32,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:04:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:04:32,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-04 01:04:32,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.631762652705061 [2023-08-04 01:04:32,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-04 01:04:32,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-04 01:04:32,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:04:32,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-04 01:04:32,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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) [2023-08-04 01:04:32,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 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) [2023-08-04 01:04:32,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 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) [2023-08-04 01:04:32,121 INFO L175 Difference]: Start difference. First operand has 55 places, 37 transitions, 128 flow. Second operand 3 states and 362 transitions. [2023-08-04 01:04:32,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 216 flow [2023-08-04 01:04:32,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 209 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-04 01:04:32,124 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 136 flow [2023-08-04 01:04:32,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2023-08-04 01:04:32,126 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2023-08-04 01:04:32,128 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 136 flow [2023-08-04 01:04:32,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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) [2023-08-04 01:04:32,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:04:32,132 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:04:32,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 01:04:32,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-04 01:04:32,338 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:04:32,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:04:32,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1187190209, now seen corresponding path program 1 times [2023-08-04 01:04:32,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:04:32,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663558974] [2023-08-04 01:04:32,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:32,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:04:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:04:32,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:04:32,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663558974] [2023-08-04 01:04:32,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663558974] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:04:32,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172561288] [2023-08-04 01:04:32,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:32,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:32,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:04:32,417 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:04:32,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 01:04:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:32,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:04:32,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:04:32,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:04:32,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:04:32,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:04:32,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172561288] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:04:32,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:04:32,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 01:04:32,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756989966] [2023-08-04 01:04:32,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:04:32,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:04:32,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:04:32,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:04:32,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:04:32,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 191 [2023-08-04 01:04:32,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 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) [2023-08-04 01:04:32,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:04:32,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 191 [2023-08-04 01:04:32,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:04:33,486 INFO L124 PetriNetUnfolderBase]: 9694/14348 cut-off events. [2023-08-04 01:04:33,487 INFO L125 PetriNetUnfolderBase]: For 1233/1233 co-relation queries the response was YES. [2023-08-04 01:04:33,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29073 conditions, 14348 events. 9694/14348 cut-off events. For 1233/1233 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 90410 event pairs, 5616 based on Foata normal form. 3/14269 useless extension candidates. Maximal degree in co-relation 10348. Up to 12736 conditions per place. [2023-08-04 01:04:33,567 INFO L140 encePairwiseOnDemand]: 188/191 looper letters, 32 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2023-08-04 01:04:33,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 44 transitions, 213 flow [2023-08-04 01:04:33,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:04:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:04:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2023-08-04 01:04:33,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6112565445026178 [2023-08-04 01:04:33,570 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 467 transitions. [2023-08-04 01:04:33,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 467 transitions. [2023-08-04 01:04:33,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:04:33,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 467 transitions. [2023-08-04 01:04:33,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 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) [2023-08-04 01:04:33,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 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) [2023-08-04 01:04:33,573 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 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) [2023-08-04 01:04:33,573 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 136 flow. Second operand 4 states and 467 transitions. [2023-08-04 01:04:33,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 44 transitions, 213 flow [2023-08-04 01:04:33,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 44 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:04:33,575 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 131 flow [2023-08-04 01:04:33,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2023-08-04 01:04:33,576 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2023-08-04 01:04:33,576 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 131 flow [2023-08-04 01:04:33,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 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) [2023-08-04 01:04:33,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:04:33,577 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:04:33,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 01:04:33,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:33,783 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:04:33,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:04:33,783 INFO L85 PathProgramCache]: Analyzing trace with hash -769076623, now seen corresponding path program 1 times [2023-08-04 01:04:33,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:04:33,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87790954] [2023-08-04 01:04:33,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:33,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:04:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 01:04:33,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:04:33,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87790954] [2023-08-04 01:04:33,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87790954] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:04:33,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720511709] [2023-08-04 01:04:33,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:33,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:33,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:04:33,885 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:04:33,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 01:04:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:33,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 01:04:33,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:04:33,994 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 01:04:33,995 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:04:33,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720511709] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:04:33,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:04:33,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 01:04:33,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629099206] [2023-08-04 01:04:33,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:04:33,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:04:33,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:04:33,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:04:33,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 01:04:34,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 191 [2023-08-04 01:04:34,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 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) [2023-08-04 01:04:34,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:04:34,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 191 [2023-08-04 01:04:34,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:04:34,916 INFO L124 PetriNetUnfolderBase]: 9478/14137 cut-off events. [2023-08-04 01:04:34,916 INFO L125 PetriNetUnfolderBase]: For 1006/1006 co-relation queries the response was YES. [2023-08-04 01:04:34,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28524 conditions, 14137 events. 9478/14137 cut-off events. For 1006/1006 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 89915 event pairs, 2182 based on Foata normal form. 81/14217 useless extension candidates. Maximal degree in co-relation 10145. Up to 11907 conditions per place. [2023-08-04 01:04:34,987 INFO L140 encePairwiseOnDemand]: 187/191 looper letters, 44 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2023-08-04 01:04:34,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 56 transitions, 265 flow [2023-08-04 01:04:34,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 01:04:34,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 01:04:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2023-08-04 01:04:34,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6157068062827226 [2023-08-04 01:04:34,994 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 588 transitions. [2023-08-04 01:04:34,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 588 transitions. [2023-08-04 01:04:34,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:04:34,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 588 transitions. [2023-08-04 01:04:34,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 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) [2023-08-04 01:04:35,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 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) [2023-08-04 01:04:35,006 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 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) [2023-08-04 01:04:35,006 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 131 flow. Second operand 5 states and 588 transitions. [2023-08-04 01:04:35,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 56 transitions, 265 flow [2023-08-04 01:04:35,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 258 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 01:04:35,013 INFO L231 Difference]: Finished difference. Result has 59 places, 37 transitions, 141 flow [2023-08-04 01:04:35,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=59, PETRI_TRANSITIONS=37} [2023-08-04 01:04:35,017 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2023-08-04 01:04:35,018 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 37 transitions, 141 flow [2023-08-04 01:04:35,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 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) [2023-08-04 01:04:35,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:04:35,018 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:04:35,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 01:04:35,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:35,227 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:04:35,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:04:35,228 INFO L85 PathProgramCache]: Analyzing trace with hash -168471838, now seen corresponding path program 1 times [2023-08-04 01:04:35,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:04:35,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937427053] [2023-08-04 01:04:35,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:35,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:04:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:04:35,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:04:35,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937427053] [2023-08-04 01:04:35,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937427053] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:04:35,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107539724] [2023-08-04 01:04:35,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:35,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:35,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:04:35,304 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:04:35,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 01:04:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:35,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:04:35,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:04:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:04:35,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:04:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:04:35,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107539724] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:04:35,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:04:35,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 01:04:35,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287602974] [2023-08-04 01:04:35,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:04:35,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:04:35,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:04:35,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:04:35,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:04:35,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 191 [2023-08-04 01:04:35,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 37 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 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) [2023-08-04 01:04:35,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:04:35,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 191 [2023-08-04 01:04:35,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:04:36,147 INFO L124 PetriNetUnfolderBase]: 7588/11167 cut-off events. [2023-08-04 01:04:36,147 INFO L125 PetriNetUnfolderBase]: For 1324/1324 co-relation queries the response was YES. [2023-08-04 01:04:36,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22887 conditions, 11167 events. 7588/11167 cut-off events. For 1324/1324 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 66995 event pairs, 4450 based on Foata normal form. 27/11193 useless extension candidates. Maximal degree in co-relation 8117. Up to 9394 conditions per place. [2023-08-04 01:04:36,225 INFO L140 encePairwiseOnDemand]: 188/191 looper letters, 40 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2023-08-04 01:04:36,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 51 transitions, 251 flow [2023-08-04 01:04:36,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:04:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:04:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-08-04 01:04:36,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6217277486910995 [2023-08-04 01:04:36,228 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-08-04 01:04:36,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-08-04 01:04:36,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:04:36,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-08-04 01:04:36,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 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) [2023-08-04 01:04:36,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 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) [2023-08-04 01:04:36,231 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 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) [2023-08-04 01:04:36,231 INFO L175 Difference]: Start difference. First operand has 59 places, 37 transitions, 141 flow. Second operand 4 states and 475 transitions. [2023-08-04 01:04:36,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 51 transitions, 251 flow [2023-08-04 01:04:36,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 51 transitions, 246 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 01:04:36,234 INFO L231 Difference]: Finished difference. Result has 60 places, 36 transitions, 134 flow [2023-08-04 01:04:36,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=60, PETRI_TRANSITIONS=36} [2023-08-04 01:04:36,235 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2023-08-04 01:04:36,235 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 36 transitions, 134 flow [2023-08-04 01:04:36,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 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) [2023-08-04 01:04:36,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:04:36,236 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:04:36,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-04 01:04:36,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:36,445 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:04:36,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:04:36,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1999212213, now seen corresponding path program 1 times [2023-08-04 01:04:36,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:04:36,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033467948] [2023-08-04 01:04:36,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:36,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:04:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 01:04:36,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:04:36,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033467948] [2023-08-04 01:04:36,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033467948] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:04:36,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222650679] [2023-08-04 01:04:36,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:36,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:36,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:04:36,523 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:04:36,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 01:04:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:36,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 01:04:36,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:04:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 01:04:36,639 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:04:36,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222650679] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:04:36,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:04:36,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 01:04:36,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442659600] [2023-08-04 01:04:36,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:04:36,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 01:04:36,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:04:36,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 01:04:36,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:04:36,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 191 [2023-08-04 01:04:36,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 36 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 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) [2023-08-04 01:04:36,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:04:36,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 191 [2023-08-04 01:04:36,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:04:37,198 INFO L124 PetriNetUnfolderBase]: 4672/6955 cut-off events. [2023-08-04 01:04:37,198 INFO L125 PetriNetUnfolderBase]: For 1198/1198 co-relation queries the response was YES. [2023-08-04 01:04:37,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14814 conditions, 6955 events. 4672/6955 cut-off events. For 1198/1198 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 38823 event pairs, 568 based on Foata normal form. 729/7683 useless extension candidates. Maximal degree in co-relation 7268. Up to 4212 conditions per place. [2023-08-04 01:04:37,211 INFO L140 encePairwiseOnDemand]: 189/191 looper letters, 0 selfloop transitions, 0 changer transitions 53/53 dead transitions. [2023-08-04 01:04:37,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 258 flow [2023-08-04 01:04:37,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:04:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:04:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-08-04 01:04:37,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6295811518324608 [2023-08-04 01:04:37,213 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-08-04 01:04:37,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-08-04 01:04:37,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:04:37,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-08-04 01:04:37,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 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) [2023-08-04 01:04:37,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 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) [2023-08-04 01:04:37,216 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 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) [2023-08-04 01:04:37,216 INFO L175 Difference]: Start difference. First operand has 60 places, 36 transitions, 134 flow. Second operand 4 states and 481 transitions. [2023-08-04 01:04:37,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 53 transitions, 258 flow [2023-08-04 01:04:37,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 251 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 01:04:37,233 INFO L231 Difference]: Finished difference. Result has 58 places, 0 transitions, 0 flow [2023-08-04 01:04:37,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=58, PETRI_TRANSITIONS=0} [2023-08-04 01:04:37,234 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2023-08-04 01:04:37,234 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 0 transitions, 0 flow [2023-08-04 01:04:37,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 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) [2023-08-04 01:04:37,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 01:04:37,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 01:04:37,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 01:04:37,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 01:04:37,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:37,440 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:04:37,441 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE,SAFE (1/2) [2023-08-04 01:04:37,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 286 flow [2023-08-04 01:04:37,514 INFO L124 PetriNetUnfolderBase]: 93/1298 cut-off events. [2023-08-04 01:04:37,514 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 01:04:37,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 1298 events. 93/1298 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8843 event pairs, 0 based on Foata normal form. 0/1139 useless extension candidates. Maximal degree in co-relation 939. Up to 54 conditions per place. [2023-08-04 01:04:37,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 286 flow [2023-08-04 01:04:37,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 244 flow [2023-08-04 01:04:37,519 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:04:37,519 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 244 flow [2023-08-04 01:04:37,519 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 244 flow [2023-08-04 01:04:37,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 244 flow [2023-08-04 01:04:37,576 INFO L124 PetriNetUnfolderBase]: 66/961 cut-off events. [2023-08-04 01:04:37,576 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-04 01:04:37,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 961 events. 66/961 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5972 event pairs, 0 based on Foata normal form. 0/856 useless extension candidates. Maximal degree in co-relation 711. Up to 54 conditions per place. [2023-08-04 01:04:37,592 INFO L119 LiptonReduction]: Number of co-enabled transitions 3716 [2023-08-04 01:04:39,346 INFO L134 LiptonReduction]: Checked pairs total: 6688 [2023-08-04 01:04:39,346 INFO L136 LiptonReduction]: Total number of compositions: 80 [2023-08-04 01:04:39,348 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 01:04:39,348 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@26b1ff0d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:04:39,348 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 01:04:39,350 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:04:39,350 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-04 01:04:39,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:04:39,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:04:39,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 01:04:39,350 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:04:39,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:04:39,351 INFO L85 PathProgramCache]: Analyzing trace with hash 616110735, now seen corresponding path program 1 times [2023-08-04 01:04:39,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:04:39,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285142111] [2023-08-04 01:04:39,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:39,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:04:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 01:04:39,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:04:39,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285142111] [2023-08-04 01:04:39,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285142111] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:04:39,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:04:39,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:04:39,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239567269] [2023-08-04 01:04:39,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:04:39,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:04:39,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:04:39,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:04:39,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:04:39,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 205 [2023-08-04 01:04:39,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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) [2023-08-04 01:04:39,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:04:39,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 205 [2023-08-04 01:04:39,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:04:41,947 INFO L124 PetriNetUnfolderBase]: 33046/46067 cut-off events. [2023-08-04 01:04:41,948 INFO L125 PetriNetUnfolderBase]: For 1473/1473 co-relation queries the response was YES. [2023-08-04 01:04:42,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91458 conditions, 46067 events. 33046/46067 cut-off events. For 1473/1473 co-relation queries the response was YES. Maximal size of possible extension queue 1458. Compared 295747 event pairs, 26064 based on Foata normal form. 0/43249 useless extension candidates. Maximal degree in co-relation 25825. Up to 43520 conditions per place. [2023-08-04 01:04:42,125 INFO L140 encePairwiseOnDemand]: 202/205 looper letters, 31 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-08-04 01:04:42,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 170 flow [2023-08-04 01:04:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:04:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:04:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-04 01:04:42,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5869918699186992 [2023-08-04 01:04:42,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-04 01:04:42,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-04 01:04:42,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:04:42,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-04 01:04:42,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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) [2023-08-04 01:04:42,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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) [2023-08-04 01:04:42,133 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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) [2023-08-04 01:04:42,133 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 96 flow. Second operand 3 states and 361 transitions. [2023-08-04 01:04:42,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 170 flow [2023-08-04 01:04:42,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 40 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 01:04:42,134 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 108 flow [2023-08-04 01:04:42,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-08-04 01:04:42,135 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2023-08-04 01:04:42,135 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 108 flow [2023-08-04 01:04:42,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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) [2023-08-04 01:04:42,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:04:42,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:04:42,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 01:04:42,136 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:04:42,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:04:42,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1555750121, now seen corresponding path program 1 times [2023-08-04 01:04:42,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:04:42,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48225911] [2023-08-04 01:04:42,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:42,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:04:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 01:04:42,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:04:42,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48225911] [2023-08-04 01:04:42,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48225911] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:04:42,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281689456] [2023-08-04 01:04:42,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:42,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:42,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:04:42,169 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:04:42,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-04 01:04:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:42,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 01:04:42,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:04:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 01:04:42,260 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:04:42,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281689456] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:04:42,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:04:42,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 01:04:42,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319384553] [2023-08-04 01:04:42,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:04:42,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:04:42,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:04:42,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:04:42,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:04:42,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 205 [2023-08-04 01:04:42,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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) [2023-08-04 01:04:42,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:04:42,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 205 [2023-08-04 01:04:42,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:04:44,718 INFO L124 PetriNetUnfolderBase]: 31406/44393 cut-off events. [2023-08-04 01:04:44,718 INFO L125 PetriNetUnfolderBase]: For 1287/1287 co-relation queries the response was YES. [2023-08-04 01:04:44,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87274 conditions, 44393 events. 31406/44393 cut-off events. For 1287/1287 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 290709 event pairs, 24928 based on Foata normal form. 0/42160 useless extension candidates. Maximal degree in co-relation 87237. Up to 40987 conditions per place. [2023-08-04 01:04:44,907 INFO L140 encePairwiseOnDemand]: 202/205 looper letters, 36 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-04 01:04:44,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 45 transitions, 200 flow [2023-08-04 01:04:44,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:04:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:04:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-08-04 01:04:44,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5934959349593496 [2023-08-04 01:04:44,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-08-04 01:04:44,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-08-04 01:04:44,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:04:44,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-08-04 01:04:44,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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) [2023-08-04 01:04:44,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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) [2023-08-04 01:04:44,911 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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) [2023-08-04 01:04:44,911 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 108 flow. Second operand 3 states and 365 transitions. [2023-08-04 01:04:44,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 45 transitions, 200 flow [2023-08-04 01:04:44,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:04:44,913 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 118 flow [2023-08-04 01:04:44,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2023-08-04 01:04:44,914 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2023-08-04 01:04:44,914 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 118 flow [2023-08-04 01:04:44,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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) [2023-08-04 01:04:44,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:04:44,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:04:44,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-04 01:04:45,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:45,119 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:04:45,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:04:45,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1485590916, now seen corresponding path program 1 times [2023-08-04 01:04:45,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:04:45,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768915523] [2023-08-04 01:04:45,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:45,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:04:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 01:04:45,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:04:45,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768915523] [2023-08-04 01:04:45,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768915523] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:04:45,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057134947] [2023-08-04 01:04:45,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:45,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:45,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:04:45,189 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:04:45,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 01:04:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:45,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 01:04:45,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:04:45,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 01:04:45,258 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:04:45,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057134947] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:04:45,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:04:45,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 01:04:45,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848593826] [2023-08-04 01:04:45,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:04:45,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:04:45,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:04:45,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:04:45,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:04:45,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 205 [2023-08-04 01:04:45,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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) [2023-08-04 01:04:45,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:04:45,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 205 [2023-08-04 01:04:45,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:04:47,939 INFO L124 PetriNetUnfolderBase]: 30734/43106 cut-off events. [2023-08-04 01:04:47,940 INFO L125 PetriNetUnfolderBase]: For 833/833 co-relation queries the response was YES. [2023-08-04 01:04:48,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85361 conditions, 43106 events. 30734/43106 cut-off events. For 833/833 co-relation queries the response was YES. Maximal size of possible extension queue 1508. Compared 279309 event pairs, 23582 based on Foata normal form. 0/41374 useless extension candidates. Maximal degree in co-relation 24260. Up to 37757 conditions per place. [2023-08-04 01:04:48,138 INFO L140 encePairwiseOnDemand]: 202/205 looper letters, 41 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-04 01:04:48,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 228 flow [2023-08-04 01:04:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:04:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:04:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-04 01:04:48,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2023-08-04 01:04:48,140 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-04 01:04:48,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-04 01:04:48,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:04:48,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-04 01:04:48,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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) [2023-08-04 01:04:48,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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) [2023-08-04 01:04:48,142 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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) [2023-08-04 01:04:48,142 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 118 flow. Second operand 3 states and 369 transitions. [2023-08-04 01:04:48,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 228 flow [2023-08-04 01:04:48,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:04:48,144 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 128 flow [2023-08-04 01:04:48,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2023-08-04 01:04:48,145 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2023-08-04 01:04:48,145 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 128 flow [2023-08-04 01:04:48,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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) [2023-08-04 01:04:48,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:04:48,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:04:48,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 01:04:48,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-04 01:04:48,351 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:04:48,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:04:48,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1305823384, now seen corresponding path program 1 times [2023-08-04 01:04:48,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:04:48,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450165402] [2023-08-04 01:04:48,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:48,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:04:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 01:04:48,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:04:48,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450165402] [2023-08-04 01:04:48,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450165402] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:04:48,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411265813] [2023-08-04 01:04:48,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:48,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:48,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:04:48,416 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:04:48,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-04 01:04:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:48,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:04:48,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:04:48,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 01:04:48,509 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:04:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 01:04:48,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411265813] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:04:48,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:04:48,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 01:04:48,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403696278] [2023-08-04 01:04:48,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:04:48,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:04:48,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:04:48,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:04:48,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:04:48,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 205 [2023-08-04 01:04:48,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 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) [2023-08-04 01:04:48,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:04:48,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 205 [2023-08-04 01:04:48,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:04:50,518 INFO L124 PetriNetUnfolderBase]: 24232/33704 cut-off events. [2023-08-04 01:04:50,518 INFO L125 PetriNetUnfolderBase]: For 3705/3705 co-relation queries the response was YES. [2023-08-04 01:04:50,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69593 conditions, 33704 events. 24232/33704 cut-off events. For 3705/3705 co-relation queries the response was YES. Maximal size of possible extension queue 1245. Compared 207150 event pairs, 14820 based on Foata normal form. 3/33679 useless extension candidates. Maximal degree in co-relation 24747. Up to 31258 conditions per place. [2023-08-04 01:04:50,699 INFO L140 encePairwiseOnDemand]: 201/205 looper letters, 36 selfloop transitions, 3 changer transitions 1/47 dead transitions. [2023-08-04 01:04:50,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 47 transitions, 224 flow [2023-08-04 01:04:50,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:04:50,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:04:50,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2023-08-04 01:04:50,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.574390243902439 [2023-08-04 01:04:50,701 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 471 transitions. [2023-08-04 01:04:50,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions. [2023-08-04 01:04:50,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:04:50,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions. [2023-08-04 01:04:50,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 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) [2023-08-04 01:04:50,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 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) [2023-08-04 01:04:50,704 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 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) [2023-08-04 01:04:50,704 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 128 flow. Second operand 4 states and 471 transitions. [2023-08-04 01:04:50,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 47 transitions, 224 flow [2023-08-04 01:04:50,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 47 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:04:50,709 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 140 flow [2023-08-04 01:04:50,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2023-08-04 01:04:50,709 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2023-08-04 01:04:50,710 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 140 flow [2023-08-04 01:04:50,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 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) [2023-08-04 01:04:50,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:04:50,710 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:04:50,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 01:04:50,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:50,916 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:04:50,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:04:50,916 INFO L85 PathProgramCache]: Analyzing trace with hash -429810127, now seen corresponding path program 1 times [2023-08-04 01:04:50,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:04:50,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864670402] [2023-08-04 01:04:50,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:50,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:04:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:50,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 01:04:50,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:04:50,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864670402] [2023-08-04 01:04:50,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864670402] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:04:50,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650243506] [2023-08-04 01:04:50,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:50,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:50,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:04:50,973 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:04:50,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-04 01:04:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:51,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:04:51,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:04:51,079 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 01:04:51,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:04:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 01:04:51,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650243506] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:04:51,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:04:51,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 01:04:51,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462225073] [2023-08-04 01:04:51,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:04:51,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:04:51,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:04:51,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:04:51,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:04:51,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 205 [2023-08-04 01:04:51,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 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) [2023-08-04 01:04:51,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:04:51,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 205 [2023-08-04 01:04:51,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:04:52,623 INFO L124 PetriNetUnfolderBase]: 19198/26422 cut-off events. [2023-08-04 01:04:52,623 INFO L125 PetriNetUnfolderBase]: For 2439/2439 co-relation queries the response was YES. [2023-08-04 01:04:52,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54308 conditions, 26422 events. 19198/26422 cut-off events. For 2439/2439 co-relation queries the response was YES. Maximal size of possible extension queue 1113. Compared 154000 event pairs, 11902 based on Foata normal form. 27/26448 useless extension candidates. Maximal degree in co-relation 19274. Up to 23785 conditions per place. [2023-08-04 01:04:52,912 INFO L140 encePairwiseOnDemand]: 201/205 looper letters, 44 selfloop transitions, 3 changer transitions 1/55 dead transitions. [2023-08-04 01:04:52,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 268 flow [2023-08-04 01:04:52,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:04:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:04:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-08-04 01:04:52,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5841463414634146 [2023-08-04 01:04:52,913 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-08-04 01:04:52,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-08-04 01:04:52,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:04:52,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-08-04 01:04:52,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 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) [2023-08-04 01:04:52,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 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) [2023-08-04 01:04:52,917 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 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) [2023-08-04 01:04:52,917 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 140 flow. Second operand 4 states and 479 transitions. [2023-08-04 01:04:52,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 268 flow [2023-08-04 01:04:52,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 261 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 01:04:52,922 INFO L231 Difference]: Finished difference. Result has 62 places, 39 transitions, 147 flow [2023-08-04 01:04:52,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=62, PETRI_TRANSITIONS=39} [2023-08-04 01:04:52,923 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2023-08-04 01:04:52,923 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 39 transitions, 147 flow [2023-08-04 01:04:52,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 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) [2023-08-04 01:04:52,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:04:52,924 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:04:52,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-04 01:04:53,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 01:04:53,130 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:04:53,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:04:53,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1865741373, now seen corresponding path program 1 times [2023-08-04 01:04:53,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:04:53,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113678558] [2023-08-04 01:04:53,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:53,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:04:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 01:04:53,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:04:53,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113678558] [2023-08-04 01:04:53,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113678558] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:04:53,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708941525] [2023-08-04 01:04:53,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:53,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:04:53,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:04:53,181 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:04:53,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-04 01:04:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:53,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:04:53,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:04:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 01:04:53,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:04:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 01:04:53,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708941525] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:04:53,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:04:53,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 01:04:53,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782344757] [2023-08-04 01:04:53,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:04:53,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:04:53,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:04:53,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:04:53,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:04:53,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 205 [2023-08-04 01:04:53,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 39 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 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) [2023-08-04 01:04:53,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:04:53,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 205 [2023-08-04 01:04:53,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:04:54,680 INFO L124 PetriNetUnfolderBase]: 17362/23128 cut-off events. [2023-08-04 01:04:54,680 INFO L125 PetriNetUnfolderBase]: For 2377/2377 co-relation queries the response was YES. [2023-08-04 01:04:54,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48673 conditions, 23128 events. 17362/23128 cut-off events. For 2377/2377 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 124301 event pairs, 6886 based on Foata normal form. 243/23370 useless extension candidates. Maximal degree in co-relation 17270. Up to 11794 conditions per place. [2023-08-04 01:04:54,804 INFO L140 encePairwiseOnDemand]: 201/205 looper letters, 52 selfloop transitions, 3 changer transitions 1/63 dead transitions. [2023-08-04 01:04:54,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 307 flow [2023-08-04 01:04:54,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:04:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:04:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-08-04 01:04:54,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5939024390243902 [2023-08-04 01:04:54,806 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-08-04 01:04:54,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-08-04 01:04:54,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:04:54,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-08-04 01:04:54,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 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) [2023-08-04 01:04:54,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 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) [2023-08-04 01:04:54,810 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 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) [2023-08-04 01:04:54,810 INFO L175 Difference]: Start difference. First operand has 62 places, 39 transitions, 147 flow. Second operand 4 states and 487 transitions. [2023-08-04 01:04:54,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 307 flow [2023-08-04 01:04:54,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 63 transitions, 300 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 01:04:54,814 INFO L231 Difference]: Finished difference. Result has 64 places, 39 transitions, 154 flow [2023-08-04 01:04:54,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2023-08-04 01:04:54,814 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2023-08-04 01:04:54,814 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 154 flow [2023-08-04 01:04:54,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 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) [2023-08-04 01:04:54,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:04:54,815 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:04:54,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 01:04:55,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-04 01:04:55,020 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:04:55,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:04:55,020 INFO L85 PathProgramCache]: Analyzing trace with hash 703556898, now seen corresponding path program 1 times [2023-08-04 01:04:55,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:04:55,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692218828] [2023-08-04 01:04:55,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:55,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:04:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 01:04:55,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:04:55,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692218828] [2023-08-04 01:04:55,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692218828] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:04:55,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:04:55,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 01:04:55,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139581013] [2023-08-04 01:04:55,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:04:55,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:04:55,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:04:55,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:04:55,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:04:55,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 205 [2023-08-04 01:04:55,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 39 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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) [2023-08-04 01:04:55,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:04:55,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 205 [2023-08-04 01:04:55,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:04:58,119 INFO L124 PetriNetUnfolderBase]: 45682/57479 cut-off events. [2023-08-04 01:04:58,119 INFO L125 PetriNetUnfolderBase]: For 28692/28692 co-relation queries the response was YES. [2023-08-04 01:04:58,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131597 conditions, 57479 events. 45682/57479 cut-off events. For 28692/28692 co-relation queries the response was YES. Maximal size of possible extension queue 1648. Compared 276153 event pairs, 14230 based on Foata normal form. 36/57492 useless extension candidates. Maximal degree in co-relation 97255. Up to 56085 conditions per place. [2023-08-04 01:04:58,418 INFO L140 encePairwiseOnDemand]: 199/205 looper letters, 58 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2023-08-04 01:04:58,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 404 flow [2023-08-04 01:04:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:04:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:04:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-04 01:04:58,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6016260162601627 [2023-08-04 01:04:58,419 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-04 01:04:58,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-04 01:04:58,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:04:58,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-04 01:04:58,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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) [2023-08-04 01:04:58,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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) [2023-08-04 01:04:58,421 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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) [2023-08-04 01:04:58,421 INFO L175 Difference]: Start difference. First operand has 64 places, 39 transitions, 154 flow. Second operand 3 states and 370 transitions. [2023-08-04 01:04:58,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 404 flow [2023-08-04 01:04:58,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 66 transitions, 390 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 01:04:58,434 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 180 flow [2023-08-04 01:04:58,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2023-08-04 01:04:58,435 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2023-08-04 01:04:58,435 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 180 flow [2023-08-04 01:04:58,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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) [2023-08-04 01:04:58,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:04:58,436 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:04:58,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 01:04:58,436 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:04:58,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:04:58,436 INFO L85 PathProgramCache]: Analyzing trace with hash 335426361, now seen corresponding path program 1 times [2023-08-04 01:04:58,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:04:58,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858430340] [2023-08-04 01:04:58,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:04:58,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:04:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:04:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 01:04:58,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:04:58,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858430340] [2023-08-04 01:04:58,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858430340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:04:58,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:04:58,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:04:58,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822950112] [2023-08-04 01:04:58,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:04:58,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 01:04:58,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:04:58,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 01:04:58,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 01:04:58,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 205 [2023-08-04 01:04:58,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 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) [2023-08-04 01:04:58,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:04:58,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 205 [2023-08-04 01:04:58,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:05:03,226 INFO L124 PetriNetUnfolderBase]: 62854/78891 cut-off events. [2023-08-04 01:05:03,226 INFO L125 PetriNetUnfolderBase]: For 38932/38932 co-relation queries the response was YES. [2023-08-04 01:05:03,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190460 conditions, 78891 events. 62854/78891 cut-off events. For 38932/38932 co-relation queries the response was YES. Maximal size of possible extension queue 2401. Compared 401638 event pairs, 4014 based on Foata normal form. 1008/79866 useless extension candidates. Maximal degree in co-relation 142345. Up to 58401 conditions per place. [2023-08-04 01:05:03,677 INFO L140 encePairwiseOnDemand]: 195/205 looper letters, 105 selfloop transitions, 23 changer transitions 0/131 dead transitions. [2023-08-04 01:05:03,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 131 transitions, 793 flow [2023-08-04 01:05:03,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 01:05:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 01:05:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2023-08-04 01:05:03,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6019512195121951 [2023-08-04 01:05:03,679 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2023-08-04 01:05:03,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2023-08-04 01:05:03,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:05:03,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2023-08-04 01:05:03,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 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) [2023-08-04 01:05:03,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 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) [2023-08-04 01:05:03,682 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 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) [2023-08-04 01:05:03,682 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 180 flow. Second operand 5 states and 617 transitions. [2023-08-04 01:05:03,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 131 transitions, 793 flow [2023-08-04 01:05:03,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 131 transitions, 784 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:05:03,695 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 358 flow [2023-08-04 01:05:03,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2023-08-04 01:05:03,695 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2023-08-04 01:05:03,695 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 358 flow [2023-08-04 01:05:03,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 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) [2023-08-04 01:05:03,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:05:03,696 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:05:03,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 01:05:03,696 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:05:03,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:05:03,696 INFO L85 PathProgramCache]: Analyzing trace with hash -475774653, now seen corresponding path program 1 times [2023-08-04 01:05:03,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:05:03,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877376422] [2023-08-04 01:05:03,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:05:03,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:05:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:05:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 01:05:04,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:05:04,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877376422] [2023-08-04 01:05:04,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877376422] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:05:04,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:05:04,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:05:04,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400386294] [2023-08-04 01:05:04,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:05:04,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 01:05:04,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:05:04,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 01:05:04,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 01:05:04,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 205 [2023-08-04 01:05:04,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 63 transitions, 358 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 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) [2023-08-04 01:05:04,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:05:04,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 205 [2023-08-04 01:05:04,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:05:08,812 INFO L124 PetriNetUnfolderBase]: 61558/77593 cut-off events. [2023-08-04 01:05:08,812 INFO L125 PetriNetUnfolderBase]: For 105019/105019 co-relation queries the response was YES. [2023-08-04 01:05:09,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256993 conditions, 77593 events. 61558/77593 cut-off events. For 105019/105019 co-relation queries the response was YES. Maximal size of possible extension queue 2321. Compared 379894 event pairs, 16784 based on Foata normal form. 108/77700 useless extension candidates. Maximal degree in co-relation 76416. Up to 71221 conditions per place. [2023-08-04 01:05:09,546 INFO L140 encePairwiseOnDemand]: 201/205 looper letters, 74 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2023-08-04 01:05:09,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 86 transitions, 645 flow [2023-08-04 01:05:09,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:05:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:05:09,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-04 01:05:09,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5886178861788618 [2023-08-04 01:05:09,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-04 01:05:09,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-04 01:05:09,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:05:09,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-04 01:05:09,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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) [2023-08-04 01:05:09,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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) [2023-08-04 01:05:09,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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) [2023-08-04 01:05:09,550 INFO L175 Difference]: Start difference. First operand has 70 places, 63 transitions, 358 flow. Second operand 3 states and 362 transitions. [2023-08-04 01:05:09,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 86 transitions, 645 flow [2023-08-04 01:05:09,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 86 transitions, 630 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:05:09,580 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 414 flow [2023-08-04 01:05:09,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2023-08-04 01:05:09,580 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 23 predicate places. [2023-08-04 01:05:09,581 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 414 flow [2023-08-04 01:05:09,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 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) [2023-08-04 01:05:09,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:05:09,581 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:05:09,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-04 01:05:09,581 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:05:09,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:05:09,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1805296580, now seen corresponding path program 1 times [2023-08-04 01:05:09,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:05:09,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70479902] [2023-08-04 01:05:09,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:05:09,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:05:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:05:09,707 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 01:05:09,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:05:09,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70479902] [2023-08-04 01:05:09,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70479902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:05:09,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:05:09,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:05:09,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204668253] [2023-08-04 01:05:09,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:05:09,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 01:05:09,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:05:09,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 01:05:09,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 01:05:09,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 205 [2023-08-04 01:05:09,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 414 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 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) [2023-08-04 01:05:09,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:05:09,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 205 [2023-08-04 01:05:09,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:05:13,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 61#L743true, Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 29#$Ultimate##0true, 77#$Ultimate##0true, 108#L758true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:13,318 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-08-04 01:05:13,318 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 01:05:13,318 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 01:05:13,318 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 01:05:13,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 29#$Ultimate##0true, 110#P1EXITtrue, 77#$Ultimate##0true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:13,321 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-08-04 01:05:13,321 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 01:05:13,321 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 01:05:13,321 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 01:05:13,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 61#L743true, Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 29#$Ultimate##0true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 108#L758true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P0Thread2of2ForFork0InUse, Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:05:13,918 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,918 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,918 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,918 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,921 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 29#$Ultimate##0true, 110#P1EXITtrue, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P0Thread2of2ForFork0InUse, Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:05:13,921 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,921 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,921 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,921 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,977 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 61#L743true, Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 77#$Ultimate##0true, 117#L726true, 108#L758true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:13,977 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,977 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,977 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,977 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,980 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, 77#$Ultimate##0true, 117#L726true, 108#L758true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:13,980 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,980 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,980 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,980 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,986 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, 29#$Ultimate##0true, 77#$Ultimate##0true, 108#L758true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:13,986 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,986 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,986 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:05:13,986 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:05:14,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] $Ultimate##0-->L743: Formula: (and (= |v_P1Thread2of2ForFork1_#in~arg.offset_8| v_P1Thread2of2ForFork1_~arg.offset_8) (= v_P1Thread2of2ForFork1_~arg.base_8 |v_P1Thread2of2ForFork1_#in~arg.base_8|) (= v_~x~0_35 1)) InVars {P1Thread2of2ForFork1_#in~arg.offset=|v_P1Thread2of2ForFork1_#in~arg.offset_8|, P1Thread2of2ForFork1_#in~arg.base=|v_P1Thread2of2ForFork1_#in~arg.base_8|} OutVars{P1Thread2of2ForFork1_#in~arg.offset=|v_P1Thread2of2ForFork1_#in~arg.offset_8|, P1Thread2of2ForFork1_~arg.offset=v_P1Thread2of2ForFork1_~arg.offset_8, P1Thread2of2ForFork1_#in~arg.base=|v_P1Thread2of2ForFork1_#in~arg.base_8|, ~x~0=v_~x~0_35, P1Thread2of2ForFork1_~arg.base=v_P1Thread2of2ForFork1_~arg.base_8} AuxVars[] AssignedVars[P1Thread2of2ForFork1_~arg.offset, ~x~0, P1Thread2of2ForFork1_~arg.base][49], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 61#L743true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 52#L3true, 10#P0EXITtrue, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,031 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,031 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,031 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,032 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 18#$Ultimate##0true, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 10#P0EXITtrue, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,032 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,032 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,032 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,032 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 61#L743true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 3#$Ultimate##0true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 10#P0EXITtrue, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,040 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,040 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,040 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,040 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([537] $Ultimate##0-->L743: Formula: (and (= v_~x~0_33 1) (= v_P1Thread1of2ForFork1_~arg.base_9 |v_P1Thread1of2ForFork1_#in~arg.base_9|) (= |v_P1Thread1of2ForFork1_#in~arg.offset_9| v_P1Thread1of2ForFork1_~arg.offset_9)) InVars {P1Thread1of2ForFork1_#in~arg.offset=|v_P1Thread1of2ForFork1_#in~arg.offset_9|, P1Thread1of2ForFork1_#in~arg.base=|v_P1Thread1of2ForFork1_#in~arg.base_9|} OutVars{P1Thread1of2ForFork1_#in~arg.offset=|v_P1Thread1of2ForFork1_#in~arg.offset_9|, P1Thread1of2ForFork1_~arg.offset=v_P1Thread1of2ForFork1_~arg.offset_9, P1Thread1of2ForFork1_#in~arg.base=|v_P1Thread1of2ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_33, P1Thread1of2ForFork1_~arg.base=v_P1Thread1of2ForFork1_~arg.base_9} AuxVars[] AssignedVars[P1Thread1of2ForFork1_~arg.offset, ~x~0, P1Thread1of2ForFork1_~arg.base][50], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 61#L743true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 52#L3true, 10#P0EXITtrue, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,040 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,040 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,040 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,040 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,059 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 18#$Ultimate##0true, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 10#P0EXITtrue, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,059 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,059 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,059 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,059 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,059 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,065 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 61#L743true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 3#$Ultimate##0true, 108#L758true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 97#L758true, 10#P0EXITtrue, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,065 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,066 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,066 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,066 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,066 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,079 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 61#L743true, Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 29#$Ultimate##0true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 10#P0EXITtrue, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P0Thread2of2ForFork0InUse, Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:05:14,079 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,079 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,079 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,079 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,148 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] $Ultimate##0-->L743: Formula: (and (= |v_P1Thread2of2ForFork1_#in~arg.offset_8| v_P1Thread2of2ForFork1_~arg.offset_8) (= v_P1Thread2of2ForFork1_~arg.base_8 |v_P1Thread2of2ForFork1_#in~arg.base_8|) (= v_~x~0_35 1)) InVars {P1Thread2of2ForFork1_#in~arg.offset=|v_P1Thread2of2ForFork1_#in~arg.offset_8|, P1Thread2of2ForFork1_#in~arg.base=|v_P1Thread2of2ForFork1_#in~arg.base_8|} OutVars{P1Thread2of2ForFork1_#in~arg.offset=|v_P1Thread2of2ForFork1_#in~arg.offset_8|, P1Thread2of2ForFork1_~arg.offset=v_P1Thread2of2ForFork1_~arg.offset_8, P1Thread2of2ForFork1_#in~arg.base=|v_P1Thread2of2ForFork1_#in~arg.base_8|, ~x~0=v_~x~0_35, P1Thread2of2ForFork1_~arg.base=v_P1Thread2of2ForFork1_~arg.base_8} AuxVars[] AssignedVars[P1Thread2of2ForFork1_~arg.offset, ~x~0, P1Thread2of2ForFork1_~arg.base][139], [P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 61#L743true, Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, 623#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 52#L3true, 10#P0EXITtrue, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,148 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,148 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,148 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,149 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,162 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([537] $Ultimate##0-->L743: Formula: (and (= v_~x~0_33 1) (= v_P1Thread1of2ForFork1_~arg.base_9 |v_P1Thread1of2ForFork1_#in~arg.base_9|) (= |v_P1Thread1of2ForFork1_#in~arg.offset_9| v_P1Thread1of2ForFork1_~arg.offset_9)) InVars {P1Thread1of2ForFork1_#in~arg.offset=|v_P1Thread1of2ForFork1_#in~arg.offset_9|, P1Thread1of2ForFork1_#in~arg.base=|v_P1Thread1of2ForFork1_#in~arg.base_9|} OutVars{P1Thread1of2ForFork1_#in~arg.offset=|v_P1Thread1of2ForFork1_#in~arg.offset_9|, P1Thread1of2ForFork1_~arg.offset=v_P1Thread1of2ForFork1_~arg.offset_9, P1Thread1of2ForFork1_#in~arg.base=|v_P1Thread1of2ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_33, P1Thread1of2ForFork1_~arg.base=v_P1Thread1of2ForFork1_~arg.base_9} AuxVars[] AssignedVars[P1Thread1of2ForFork1_~arg.offset, ~x~0, P1Thread1of2ForFork1_~arg.base][140], [P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 61#L743true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, 623#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 52#L3true, 10#P0EXITtrue, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,162 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,162 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,162 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,162 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 18#$Ultimate##0true, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 67#L731true, Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,176 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,176 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,176 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,176 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, 18#$Ultimate##0true, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 67#L731true, Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), 83#P2EXITtrue, Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,186 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,186 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,186 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,186 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,191 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 67#L731true, Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, 3#$Ultimate##0true, 108#L758true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 97#L758true, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,191 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,191 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,191 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,191 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,193 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 61#L743true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 67#L731true, Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), 83#P2EXITtrue, Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 3#$Ultimate##0true, 108#L758true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,193 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,193 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,193 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,193 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:05:14,200 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 61#L743true, Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 67#L731true, Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 29#$Ultimate##0true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 108#L758true, 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P0Thread2of2ForFork0InUse, Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:05:14,200 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,200 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,200 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,200 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 67#L731true, Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, 29#$Ultimate##0true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P0Thread2of2ForFork0InUse, Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:05:14,203 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,203 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,203 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,203 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, 61#L743true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 108#L758true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 117#L726true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,261 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,261 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,261 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,261 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, 108#L758true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 117#L726true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,263 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,263 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,263 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,263 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 29#$Ultimate##0true, 110#P1EXITtrue, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P0Thread2of2ForFork0InUse, Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:05:14,269 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,269 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,269 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,269 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 104#P0EXITtrue, 88#L743true, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 61#L743true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 77#$Ultimate##0true, 108#L758true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,284 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,284 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,284 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,285 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 61#L743true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 77#$Ultimate##0true, 108#L758true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 97#L758true, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,293 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,293 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,293 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,293 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, 77#$Ultimate##0true, 108#L758true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 97#L758true, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,296 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,296 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,296 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,296 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, 77#$Ultimate##0true, 117#L726true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,306 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,306 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,306 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,306 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:05:14,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] $Ultimate##0-->L743: Formula: (and (= |v_P1Thread2of2ForFork1_#in~arg.offset_8| v_P1Thread2of2ForFork1_~arg.offset_8) (= v_P1Thread2of2ForFork1_~arg.base_8 |v_P1Thread2of2ForFork1_#in~arg.base_8|) (= v_~x~0_35 1)) InVars {P1Thread2of2ForFork1_#in~arg.offset=|v_P1Thread2of2ForFork1_#in~arg.offset_8|, P1Thread2of2ForFork1_#in~arg.base=|v_P1Thread2of2ForFork1_#in~arg.base_8|} OutVars{P1Thread2of2ForFork1_#in~arg.offset=|v_P1Thread2of2ForFork1_#in~arg.offset_8|, P1Thread2of2ForFork1_~arg.offset=v_P1Thread2of2ForFork1_~arg.offset_8, P1Thread2of2ForFork1_#in~arg.base=|v_P1Thread2of2ForFork1_#in~arg.base_8|, ~x~0=v_~x~0_35, P1Thread2of2ForFork1_~arg.base=v_P1Thread2of2ForFork1_~arg.base_8} AuxVars[] AssignedVars[P1Thread2of2ForFork1_~arg.offset, ~x~0, P1Thread2of2ForFork1_~arg.base][49], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 61#L743true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 108#L758true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 97#L758true, 52#L3true, 10#P0EXITtrue, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,342 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,342 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,342 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,342 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 18#$Ultimate##0true, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 10#P0EXITtrue, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,342 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,342 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,342 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,342 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, 3#$Ultimate##0true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 10#P0EXITtrue, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,353 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,353 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,353 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,353 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([537] $Ultimate##0-->L743: Formula: (and (= v_~x~0_33 1) (= v_P1Thread1of2ForFork1_~arg.base_9 |v_P1Thread1of2ForFork1_#in~arg.base_9|) (= |v_P1Thread1of2ForFork1_#in~arg.offset_9| v_P1Thread1of2ForFork1_~arg.offset_9)) InVars {P1Thread1of2ForFork1_#in~arg.offset=|v_P1Thread1of2ForFork1_#in~arg.offset_9|, P1Thread1of2ForFork1_#in~arg.base=|v_P1Thread1of2ForFork1_#in~arg.base_9|} OutVars{P1Thread1of2ForFork1_#in~arg.offset=|v_P1Thread1of2ForFork1_#in~arg.offset_9|, P1Thread1of2ForFork1_~arg.offset=v_P1Thread1of2ForFork1_~arg.offset_9, P1Thread1of2ForFork1_#in~arg.base=|v_P1Thread1of2ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_33, P1Thread1of2ForFork1_~arg.base=v_P1Thread1of2ForFork1_~arg.base_9} AuxVars[] AssignedVars[P1Thread1of2ForFork1_~arg.offset, ~x~0, P1Thread1of2ForFork1_~arg.base][50], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 52#L3true, 10#P0EXITtrue, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,353 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,353 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,353 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,353 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,363 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, 18#$Ultimate##0true, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 10#P0EXITtrue, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,363 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,363 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,363 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,363 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,363 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,367 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 61#L743true, Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 117#L726true, 108#L758true, 97#L758true, 10#P0EXITtrue, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,367 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,367 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,367 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,367 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,370 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, 3#$Ultimate##0true, 108#L758true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 97#L758true, 10#P0EXITtrue, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,371 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,371 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,371 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,371 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,371 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 61#L743true, Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 29#$Ultimate##0true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 10#P0EXITtrue, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P0Thread2of2ForFork0InUse, Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:05:14,376 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,377 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,377 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,377 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, 29#$Ultimate##0true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 10#P0EXITtrue, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P0Thread2of2ForFork0InUse, Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:05:14,379 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,379 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,379 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,379 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,431 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] $Ultimate##0-->L743: Formula: (and (= |v_P1Thread2of2ForFork1_#in~arg.offset_8| v_P1Thread2of2ForFork1_~arg.offset_8) (= v_P1Thread2of2ForFork1_~arg.base_8 |v_P1Thread2of2ForFork1_#in~arg.base_8|) (= v_~x~0_35 1)) InVars {P1Thread2of2ForFork1_#in~arg.offset=|v_P1Thread2of2ForFork1_#in~arg.offset_8|, P1Thread2of2ForFork1_#in~arg.base=|v_P1Thread2of2ForFork1_#in~arg.base_8|} OutVars{P1Thread2of2ForFork1_#in~arg.offset=|v_P1Thread2of2ForFork1_#in~arg.offset_8|, P1Thread2of2ForFork1_~arg.offset=v_P1Thread2of2ForFork1_~arg.offset_8, P1Thread2of2ForFork1_#in~arg.base=|v_P1Thread2of2ForFork1_#in~arg.base_8|, ~x~0=v_~x~0_35, P1Thread2of2ForFork1_~arg.base=v_P1Thread2of2ForFork1_~arg.base_8} AuxVars[] AssignedVars[P1Thread2of2ForFork1_~arg.offset, ~x~0, P1Thread2of2ForFork1_~arg.base][139], [P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 61#L743true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, 623#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 52#L3true, 10#P0EXITtrue, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,431 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,431 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,431 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,431 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([537] $Ultimate##0-->L743: Formula: (and (= v_~x~0_33 1) (= v_P1Thread1of2ForFork1_~arg.base_9 |v_P1Thread1of2ForFork1_#in~arg.base_9|) (= |v_P1Thread1of2ForFork1_#in~arg.offset_9| v_P1Thread1of2ForFork1_~arg.offset_9)) InVars {P1Thread1of2ForFork1_#in~arg.offset=|v_P1Thread1of2ForFork1_#in~arg.offset_9|, P1Thread1of2ForFork1_#in~arg.base=|v_P1Thread1of2ForFork1_#in~arg.base_9|} OutVars{P1Thread1of2ForFork1_#in~arg.offset=|v_P1Thread1of2ForFork1_#in~arg.offset_9|, P1Thread1of2ForFork1_~arg.offset=v_P1Thread1of2ForFork1_~arg.offset_9, P1Thread1of2ForFork1_#in~arg.base=|v_P1Thread1of2ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_33, P1Thread1of2ForFork1_~arg.base=v_P1Thread1of2ForFork1_~arg.base_9} AuxVars[] AssignedVars[P1Thread1of2ForFork1_~arg.offset, ~x~0, P1Thread1of2ForFork1_~arg.base][140], [P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, 623#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 52#L3true, 10#P0EXITtrue, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,439 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,439 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,439 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,439 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:05:14,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 61#L743true, Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 67#L731true, Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 117#L726true, 108#L758true, 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,445 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,445 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,445 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,445 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 67#L731true, Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 117#L726true, 108#L758true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,448 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,448 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,448 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,448 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 67#L731true, Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 29#$Ultimate##0true, 110#P1EXITtrue, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P0Thread2of2ForFork0InUse, Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:05:14,470 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,470 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,470 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,470 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, 104#P0EXITtrue, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 61#L743true, Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,484 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,484 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,484 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,484 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,492 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 61#L743true, Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,492 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,492 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,492 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,492 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,495 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,495 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,495 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,495 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,504 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, 108#L758true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 117#L726true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,504 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,504 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,504 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,504 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 104#P0EXITtrue, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 61#L743true, Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 77#$Ultimate##0true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,511 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,511 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,511 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,511 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 104#P0EXITtrue, 88#L743true, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, 77#$Ultimate##0true, 108#L758true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,513 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,513 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,513 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,513 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,517 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, 77#$Ultimate##0true, 108#L758true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 97#L758true, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,517 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,517 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,517 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,517 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 01:05:14,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 61#L743true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 117#L726true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 10#P0EXITtrue, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,558 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,558 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,558 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,558 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 117#L726true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 10#P0EXITtrue, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,560 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,560 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,560 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,560 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 29#$Ultimate##0true, 110#P1EXITtrue, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 10#P0EXITtrue, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P0Thread2of2ForFork0InUse, Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:05:14,564 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,564 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,564 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,564 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 67#L731true, Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 117#L726true, 108#L758true, 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,862 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,862 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,862 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,862 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 104#P0EXITtrue, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 61#L743true, Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,871 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,871 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,871 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,871 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 88#L743true, 104#P0EXITtrue, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,873 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,873 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,873 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,873 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, 17#L731true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,877 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,877 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,877 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,877 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,883 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 104#P0EXITtrue, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, 77#$Ultimate##0true, 108#L758true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,884 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,884 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,884 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,884 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-04 01:05:14,906 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [P1Thread1of2ForFork1InUse, 620#true, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 117#L726true, 108#L758true, Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 97#L758true, 10#P0EXITtrue, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,906 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is not cut-off event [2023-08-04 01:05:14,906 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-08-04 01:05:14,906 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-08-04 01:05:14,907 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-08-04 01:05:14,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([615] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_Out_2 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_In_1 0) (= v_~__unbuffered_p2_EAX~0_In_1 1) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][147], [620#true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 114#P1EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 104#P0EXITtrue, 107#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 138#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, Black: 450#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 209#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 614#true, Black: 609#(and (= ~x~0 0) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 606#(= ~x~0 0), Black: 607#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0))), 110#P1EXITtrue, Black: 163#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 616#(<= ~__unbuffered_p2_EAX~0 0), 108#L758true, 97#L758true, P0Thread1of2ForFork0InUse, Black: 322#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 218#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P0Thread2of2ForFork0InUse]) [2023-08-04 01:05:14,929 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is not cut-off event [2023-08-04 01:05:14,929 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-08-04 01:05:14,929 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-08-04 01:05:14,929 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-08-04 01:05:14,957 INFO L124 PetriNetUnfolderBase]: 55195/72503 cut-off events. [2023-08-04 01:05:14,957 INFO L125 PetriNetUnfolderBase]: For 164010/168954 co-relation queries the response was YES. [2023-08-04 01:05:15,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226996 conditions, 72503 events. 55195/72503 cut-off events. For 164010/168954 co-relation queries the response was YES. Maximal size of possible extension queue 3320. Compared 427917 event pairs, 9901 based on Foata normal form. 3032/72707 useless extension candidates. Maximal degree in co-relation 169099. Up to 52345 conditions per place. [2023-08-04 01:05:15,482 INFO L140 encePairwiseOnDemand]: 196/205 looper letters, 131 selfloop transitions, 14 changer transitions 0/164 dead transitions. [2023-08-04 01:05:15,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 164 transitions, 1305 flow [2023-08-04 01:05:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 01:05:15,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 01:05:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2023-08-04 01:05:15,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5765853658536585 [2023-08-04 01:05:15,484 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions. [2023-08-04 01:05:15,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions. [2023-08-04 01:05:15,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:05:15,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions. [2023-08-04 01:05:15,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 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) [2023-08-04 01:05:15,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 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) [2023-08-04 01:05:15,487 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 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) [2023-08-04 01:05:15,487 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 414 flow. Second operand 5 states and 591 transitions. [2023-08-04 01:05:15,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 164 transitions, 1305 flow [2023-08-04 01:05:15,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 164 transitions, 1276 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:05:15,524 INFO L231 Difference]: Finished difference. Result has 78 places, 80 transitions, 514 flow [2023-08-04 01:05:15,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=514, PETRI_PLACES=78, PETRI_TRANSITIONS=80} [2023-08-04 01:05:15,525 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 29 predicate places. [2023-08-04 01:05:15,525 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 514 flow [2023-08-04 01:05:15,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 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) [2023-08-04 01:05:15,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:05:15,526 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:05:15,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-04 01:05:15,526 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:05:15,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:05:15,526 INFO L85 PathProgramCache]: Analyzing trace with hash -443379098, now seen corresponding path program 1 times [2023-08-04 01:05:15,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:05:15,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963226449] [2023-08-04 01:05:15,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:05:15,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:05:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:05:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 01:05:15,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:05:15,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963226449] [2023-08-04 01:05:15,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963226449] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:05:15,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144551720] [2023-08-04 01:05:15,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:05:15,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:05:15,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:05:15,637 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:05:15,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-04 01:05:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:05:15,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-04 01:05:15,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:05:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:05:15,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:05:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:05:16,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144551720] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:05:16,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:05:16,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 6] total 15 [2023-08-04 01:05:16,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193191609] [2023-08-04 01:05:16,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:05:16,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-04 01:05:16,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:05:16,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-04 01:05:16,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2023-08-04 01:05:16,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 205 [2023-08-04 01:05:16,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 514 flow. Second operand has 17 states, 17 states have (on average 91.0) internal successors, (1547), 17 states have internal predecessors, (1547), 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) [2023-08-04 01:05:16,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:05:16,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 205 [2023-08-04 01:05:16,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:05:37,056 INFO L124 PetriNetUnfolderBase]: 191473/247099 cut-off events. [2023-08-04 01:05:37,056 INFO L125 PetriNetUnfolderBase]: For 740494/740494 co-relation queries the response was YES. [2023-08-04 01:05:37,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001039 conditions, 247099 events. 191473/247099 cut-off events. For 740494/740494 co-relation queries the response was YES. Maximal size of possible extension queue 8899. Compared 1537003 event pairs, 1794 based on Foata normal form. 9764/256733 useless extension candidates. Maximal degree in co-relation 1000922. Up to 99594 conditions per place. [2023-08-04 01:05:38,588 INFO L140 encePairwiseOnDemand]: 186/205 looper letters, 506 selfloop transitions, 559 changer transitions 667/1735 dead transitions. [2023-08-04 01:05:38,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 1735 transitions, 14459 flow [2023-08-04 01:05:38,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-08-04 01:05:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2023-08-04 01:05:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 6973 transitions. [2023-08-04 01:05:38,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153732446415373 [2023-08-04 01:05:38,602 INFO L72 ComplementDD]: Start complementDD. Operand 66 states and 6973 transitions. [2023-08-04 01:05:38,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 6973 transitions. [2023-08-04 01:05:38,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:05:38,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 66 states and 6973 transitions. [2023-08-04 01:05:38,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 67 states, 66 states have (on average 105.65151515151516) internal successors, (6973), 66 states have internal predecessors, (6973), 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) [2023-08-04 01:05:38,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 67 states, 67 states have (on average 205.0) internal successors, (13735), 67 states have internal predecessors, (13735), 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) [2023-08-04 01:05:38,637 INFO L81 ComplementDD]: Finished complementDD. Result has 67 states, 67 states have (on average 205.0) internal successors, (13735), 67 states have internal predecessors, (13735), 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) [2023-08-04 01:05:38,637 INFO L175 Difference]: Start difference. First operand has 78 places, 80 transitions, 514 flow. Second operand 66 states and 6973 transitions. [2023-08-04 01:05:38,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 1735 transitions, 14459 flow [2023-08-04 01:05:39,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 1735 transitions, 14430 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:05:39,214 INFO L231 Difference]: Finished difference. Result has 169 places, 733 transitions, 6963 flow [2023-08-04 01:05:39,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=6963, PETRI_PLACES=169, PETRI_TRANSITIONS=733} [2023-08-04 01:05:39,215 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 120 predicate places. [2023-08-04 01:05:39,215 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 733 transitions, 6963 flow [2023-08-04 01:05:39,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 91.0) internal successors, (1547), 17 states have internal predecessors, (1547), 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) [2023-08-04 01:05:39,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:05:39,216 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:05:39,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-04 01:05:39,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:05:39,421 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:05:39,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:05:39,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1417570676, now seen corresponding path program 1 times [2023-08-04 01:05:39,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:05:39,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231301163] [2023-08-04 01:05:39,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:05:39,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:05:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:05:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 01:05:39,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:05:39,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231301163] [2023-08-04 01:05:39,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231301163] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:05:39,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926766782] [2023-08-04 01:05:39,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:05:39,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:05:39,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:05:39,564 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:05:39,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-04 01:05:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:05:39,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-04 01:05:39,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:05:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 01:05:39,866 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:05:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 01:05:40,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926766782] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:05:40,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:05:40,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2023-08-04 01:05:40,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533717285] [2023-08-04 01:05:40,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:05:40,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-04 01:05:40,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:05:40,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-04 01:05:40,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-08-04 01:05:40,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 205 [2023-08-04 01:05:40,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 733 transitions, 6963 flow. Second operand has 18 states, 18 states have (on average 93.66666666666667) internal successors, (1686), 18 states have internal predecessors, (1686), 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) [2023-08-04 01:05:40,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:05:40,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 205 [2023-08-04 01:05:40,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:06:27,139 INFO L124 PetriNetUnfolderBase]: 216422/280714 cut-off events. [2023-08-04 01:06:27,140 INFO L125 PetriNetUnfolderBase]: For 4793825/4793825 co-relation queries the response was YES. [2023-08-04 01:06:29,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1901673 conditions, 280714 events. 216422/280714 cut-off events. For 4793825/4793825 co-relation queries the response was YES. Maximal size of possible extension queue 11292. Compared 1822807 event pairs, 1388 based on Foata normal form. 5592/286290 useless extension candidates. Maximal degree in co-relation 1838866. Up to 111091 conditions per place. [2023-08-04 01:06:30,809 INFO L140 encePairwiseOnDemand]: 188/205 looper letters, 1267 selfloop transitions, 1611 changer transitions 905/3786 dead transitions. [2023-08-04 01:06:30,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 3786 transitions, 45199 flow [2023-08-04 01:06:30,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-08-04 01:06:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-08-04 01:06:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 5964 transitions. [2023-08-04 01:06:30,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5387533875338754 [2023-08-04 01:06:30,815 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 5964 transitions. [2023-08-04 01:06:30,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 5964 transitions. [2023-08-04 01:06:30,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:06:30,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 5964 transitions. [2023-08-04 01:06:30,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 110.44444444444444) internal successors, (5964), 54 states have internal predecessors, (5964), 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) [2023-08-04 01:06:30,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 205.0) internal successors, (11275), 55 states have internal predecessors, (11275), 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) [2023-08-04 01:06:30,838 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 205.0) internal successors, (11275), 55 states have internal predecessors, (11275), 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) [2023-08-04 01:06:30,838 INFO L175 Difference]: Start difference. First operand has 169 places, 733 transitions, 6963 flow. Second operand 54 states and 5964 transitions. [2023-08-04 01:06:30,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 3786 transitions, 45199 flow