/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 PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe014_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 06:54:58,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 06:54:58,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 06:54:58,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 06:54:58,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 06:54:58,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 06:54:58,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 06:54:58,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 06:54:58,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 06:54:58,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 06:54:58,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 06:54:58,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 06:54:58,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 06:54:58,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 06:54:58,816 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 06:54:58,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 06:54:58,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 06:54:58,816 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 06:54:58,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 06:54:58,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 06:54:58,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 06:54:58,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 06:54:58,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 06:54:58,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 06:54:58,819 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 06:54:58,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 06:54:58,819 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 06:54:58,819 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 06:54:58,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 06:54:58,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 06:54:58,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:54:58,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 06:54:58,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 06:54:58,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 06:54:58,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 06:54:58,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 06:54:58,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 06:54:58,822 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 06:54:58,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 06:54:58,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 06:54:58,822 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 06:54:58,822 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 -> PROGRAM_FIRST [2023-08-04 06:54:59,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 06:54:59,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 06:54:59,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 06:54:59,037 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 06:54:59,038 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 06:54:59,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe014_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i [2023-08-04 06:55:00,176 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 06:55:00,371 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 06:55:00,372 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe014_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i [2023-08-04 06:55:00,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bedce0367/66486030aa574c25b23971acfe3f03b2/FLAG9160037de [2023-08-04 06:55:00,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bedce0367/66486030aa574c25b23971acfe3f03b2 [2023-08-04 06:55:00,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 06:55:00,406 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 06:55:00,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 06:55:00,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 06:55:00,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 06:55:00,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:55:00" (1/1) ... [2023-08-04 06:55:00,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@553fda7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:55:00, skipping insertion in model container [2023-08-04 06:55:00,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:55:00" (1/1) ... [2023-08-04 06:55:00,463 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 06:55:00,583 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_safe014_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i[975,988] [2023-08-04 06:55:00,747 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:55:00,758 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 06:55:00,770 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_safe014_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i[975,988] [2023-08-04 06:55:00,790 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 06:55:00,792 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 06:55:00,820 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:55:00,850 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:55:00,850 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:55:00,856 INFO L206 MainTranslator]: Completed translation [2023-08-04 06:55:00,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:55:00 WrapperNode [2023-08-04 06:55:00,857 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 06:55:00,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 06:55:00,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 06:55:00,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 06:55:00,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:55:00" (1/1) ... [2023-08-04 06:55:00,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:55:00" (1/1) ... [2023-08-04 06:55:00,905 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2023-08-04 06:55:00,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 06:55:00,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 06:55:00,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 06:55:00,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 06:55:00,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:55:00" (1/1) ... [2023-08-04 06:55:00,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:55:00" (1/1) ... [2023-08-04 06:55:00,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:55:00" (1/1) ... [2023-08-04 06:55:00,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:55:00" (1/1) ... [2023-08-04 06:55:00,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:55:00" (1/1) ... [2023-08-04 06:55:00,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:55:00" (1/1) ... [2023-08-04 06:55:00,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:55:00" (1/1) ... [2023-08-04 06:55:00,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:55:00" (1/1) ... [2023-08-04 06:55:00,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 06:55:00,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 06:55:00,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 06:55:00,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 06:55:00,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:55:00" (1/1) ... [2023-08-04 06:55:00,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:55:00,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:55:00,993 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 06:55:00,994 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 06:55:01,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 06:55:01,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 06:55:01,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 06:55:01,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 06:55:01,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 06:55:01,019 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 06:55:01,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 06:55:01,019 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 06:55:01,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 06:55:01,019 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 06:55:01,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 06:55:01,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 06:55:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 06:55:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 06:55:01,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 06:55:01,021 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 06:55:01,139 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 06:55:01,141 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 06:55:01,296 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 06:55:01,303 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 06:55:01,303 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 06:55:01,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:55:01 BoogieIcfgContainer [2023-08-04 06:55:01,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 06:55:01,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 06:55:01,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 06:55:01,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 06:55:01,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 06:55:00" (1/3) ... [2023-08-04 06:55:01,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8420148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:55:01, skipping insertion in model container [2023-08-04 06:55:01,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:55:00" (2/3) ... [2023-08-04 06:55:01,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8420148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:55:01, skipping insertion in model container [2023-08-04 06:55:01,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:55:01" (3/3) ... [2023-08-04 06:55:01,312 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe014_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i [2023-08-04 06:55:01,319 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 06:55:01,327 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 06:55:01,327 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 06:55:01,327 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 06:55:01,372 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:55:01,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 106 transitions, 227 flow [2023-08-04 06:55:01,498 INFO L124 PetriNetUnfolderBase]: 30/414 cut-off events. [2023-08-04 06:55:01,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:55:01,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 414 events. 30/414 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1842 event pairs, 0 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 243. Up to 16 conditions per place. [2023-08-04 06:55:01,503 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 106 transitions, 227 flow [2023-08-04 06:55:01,507 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 91 transitions, 191 flow [2023-08-04 06:55:01,510 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:55:01,517 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 91 transitions, 191 flow [2023-08-04 06:55:01,519 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 91 transitions, 191 flow [2023-08-04 06:55:01,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 91 transitions, 191 flow [2023-08-04 06:55:01,564 INFO L124 PetriNetUnfolderBase]: 22/311 cut-off events. [2023-08-04 06:55:01,564 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:55:01,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 311 events. 22/311 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1251 event pairs, 0 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 189. Up to 16 conditions per place. [2023-08-04 06:55:01,576 INFO L119 LiptonReduction]: Number of co-enabled transitions 1620 [2023-08-04 06:55:03,423 INFO L134 LiptonReduction]: Checked pairs total: 2939 [2023-08-04 06:55:03,424 INFO L136 LiptonReduction]: Total number of compositions: 77 [2023-08-04 06:55:03,447 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:55:03,454 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;@63fbf8e1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:55:03,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 06:55:03,463 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:55:03,463 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-08-04 06:55:03,463 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:55:03,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:55:03,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:55:03,464 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:55:03,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:55:03,469 INFO L85 PathProgramCache]: Analyzing trace with hash 357342394, now seen corresponding path program 1 times [2023-08-04 06:55:03,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:55:03,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151532000] [2023-08-04 06:55:03,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:03,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:55:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:03,666 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 06:55:03,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:55:03,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151532000] [2023-08-04 06:55:03,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151532000] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:55:03,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:55:03,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:55:03,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383768906] [2023-08-04 06:55:03,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:55:03,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:55:03,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:55:03,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:55:03,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:55:03,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 183 [2023-08-04 06:55:03,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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 06:55:03,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:55:03,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 183 [2023-08-04 06:55:03,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:55:03,853 INFO L124 PetriNetUnfolderBase]: 400/751 cut-off events. [2023-08-04 06:55:03,853 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 06:55:03,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 751 events. 400/751 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3807 event pairs, 222 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 1447. Up to 668 conditions per place. [2023-08-04 06:55:03,859 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 20 selfloop transitions, 2 changer transitions 1/26 dead transitions. [2023-08-04 06:55:03,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 107 flow [2023-08-04 06:55:03,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:55:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:55:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-08-04 06:55:03,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5537340619307832 [2023-08-04 06:55:03,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-08-04 06:55:03,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-08-04 06:55:03,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:55:03,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-08-04 06:55:03,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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 06:55:03,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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 06:55:03,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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 06:55:03,901 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 57 flow. Second operand 3 states and 304 transitions. [2023-08-04 06:55:03,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 107 flow [2023-08-04 06:55:03,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 107 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:55:03,904 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 63 flow [2023-08-04 06:55:03,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-08-04 06:55:03,910 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-08-04 06:55:03,910 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 63 flow [2023-08-04 06:55:03,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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 06:55:03,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:55:03,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:55:03,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 06:55:03,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:55:03,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:55:03,912 INFO L85 PathProgramCache]: Analyzing trace with hash 646482320, now seen corresponding path program 1 times [2023-08-04 06:55:03,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:55:03,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159932012] [2023-08-04 06:55:03,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:03,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:55:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:04,061 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 06:55:04,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:55:04,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159932012] [2023-08-04 06:55:04,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159932012] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:55:04,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368516954] [2023-08-04 06:55:04,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:04,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:55:04,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:55:04,072 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 06:55:04,074 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 06:55:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:04,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:55:04,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:55:04,148 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 06:55:04,148 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:55:04,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368516954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:55:04,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:55:04,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:55:04,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111826423] [2023-08-04 06:55:04,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:55:04,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:55:04,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:55:04,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:55:04,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:55:04,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 183 [2023-08-04 06:55:04,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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 06:55:04,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:55:04,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 183 [2023-08-04 06:55:04,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:55:04,243 INFO L124 PetriNetUnfolderBase]: 338/604 cut-off events. [2023-08-04 06:55:04,243 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 06:55:04,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 604 events. 338/604 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2739 event pairs, 262 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 1184. Up to 529 conditions per place. [2023-08-04 06:55:04,247 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 22 selfloop transitions, 2 changer transitions 1/28 dead transitions. [2023-08-04 06:55:04,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 28 transitions, 123 flow [2023-08-04 06:55:04,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:55:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:55:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2023-08-04 06:55:04,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2023-08-04 06:55:04,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 305 transitions. [2023-08-04 06:55:04,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 305 transitions. [2023-08-04 06:55:04,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:55:04,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 305 transitions. [2023-08-04 06:55:04,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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 06:55:04,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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 06:55:04,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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 06:55:04,253 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 63 flow. Second operand 3 states and 305 transitions. [2023-08-04 06:55:04,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 28 transitions, 123 flow [2023-08-04 06:55:04,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 119 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 06:55:04,255 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 67 flow [2023-08-04 06:55:04,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-08-04 06:55:04,255 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2023-08-04 06:55:04,256 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 67 flow [2023-08-04 06:55:04,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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 06:55:04,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:55:04,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:55:04,270 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 06:55:04,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:55:04,463 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:55:04,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:55:04,464 INFO L85 PathProgramCache]: Analyzing trace with hash 538820375, now seen corresponding path program 1 times [2023-08-04 06:55:04,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:55:04,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238859201] [2023-08-04 06:55:04,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:04,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:55:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:04,543 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 06:55:04,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:55:04,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238859201] [2023-08-04 06:55:04,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238859201] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:55:04,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690848425] [2023-08-04 06:55:04,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:04,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:55:04,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:55:04,545 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 06:55:04,565 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 06:55:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:04,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:55:04,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:55:04,631 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 06:55:04,631 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:55:04,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690848425] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:55:04,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:55:04,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:55:04,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949129097] [2023-08-04 06:55:04,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:55:04,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:55:04,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:55:04,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:55:04,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:55:04,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 183 [2023-08-04 06:55:04,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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 06:55:04,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:55:04,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 183 [2023-08-04 06:55:04,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:55:04,724 INFO L124 PetriNetUnfolderBase]: 314/532 cut-off events. [2023-08-04 06:55:04,725 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-04 06:55:04,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1113 conditions, 532 events. 314/532 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2342 event pairs, 182 based on Foata normal form. 0/504 useless extension candidates. Maximal degree in co-relation 1097. Up to 407 conditions per place. [2023-08-04 06:55:04,728 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 24 selfloop transitions, 2 changer transitions 1/30 dead transitions. [2023-08-04 06:55:04,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 30 transitions, 135 flow [2023-08-04 06:55:04,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:55:04,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:55:04,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-08-04 06:55:04,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5591985428051002 [2023-08-04 06:55:04,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-08-04 06:55:04,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-08-04 06:55:04,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:55:04,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-08-04 06:55:04,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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 06:55:04,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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 06:55:04,737 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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 06:55:04,737 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 67 flow. Second operand 3 states and 307 transitions. [2023-08-04 06:55:04,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 30 transitions, 135 flow [2023-08-04 06:55:04,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 06:55:04,739 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 71 flow [2023-08-04 06:55:04,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-08-04 06:55:04,741 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-08-04 06:55:04,741 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 71 flow [2023-08-04 06:55:04,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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 06:55:04,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:55:04,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:55:04,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-04 06:55:04,947 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,SelfDestructingSolverStorable2 [2023-08-04 06:55:04,947 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:55:04,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:55:04,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1691162617, now seen corresponding path program 1 times [2023-08-04 06:55:04,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:55:04,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821187639] [2023-08-04 06:55:04,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:04,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:55:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:05,031 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 06:55:05,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:55:05,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821187639] [2023-08-04 06:55:05,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821187639] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:55:05,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070290003] [2023-08-04 06:55:05,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:05,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:55:05,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:55:05,037 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 06:55:05,047 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 06:55:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:05,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:55:05,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:55:05,148 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 06:55:05,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:55:05,168 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 06:55:05,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070290003] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:55:05,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:55:05,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:55:05,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421330974] [2023-08-04 06:55:05,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:55:05,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:55:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:55:05,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:55:05,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:55:05,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 183 [2023-08-04 06:55:05,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 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 06:55:05,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:55:05,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 183 [2023-08-04 06:55:05,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:55:05,203 INFO L124 PetriNetUnfolderBase]: 4/16 cut-off events. [2023-08-04 06:55:05,203 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:55:05,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 16 events. 4/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 3/19 useless extension candidates. Maximal degree in co-relation 36. Up to 10 conditions per place. [2023-08-04 06:55:05,204 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 0 selfloop transitions, 0 changer transitions 10/10 dead transitions. [2023-08-04 06:55:05,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 10 transitions, 43 flow [2023-08-04 06:55:05,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:55:05,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:55:05,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2023-08-04 06:55:05,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163934426229508 [2023-08-04 06:55:05,214 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 378 transitions. [2023-08-04 06:55:05,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 378 transitions. [2023-08-04 06:55:05,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:55:05,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 378 transitions. [2023-08-04 06:55:05,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 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 06:55:05,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 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 06:55:05,218 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 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 06:55:05,218 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 71 flow. Second operand 4 states and 378 transitions. [2023-08-04 06:55:05,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 10 transitions, 43 flow [2023-08-04 06:55:05,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 10 transitions, 41 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:55:05,219 INFO L231 Difference]: Finished difference. Result has 18 places, 0 transitions, 0 flow [2023-08-04 06:55:05,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=18, PETRI_TRANSITIONS=0} [2023-08-04 06:55:05,221 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -12 predicate places. [2023-08-04 06:55:05,221 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 0 transitions, 0 flow [2023-08-04 06:55:05,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 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 06:55:05,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 06:55:05,235 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 06:55:05,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:55:05,431 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 06:55:05,433 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 06:55:05,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 106 transitions, 227 flow [2023-08-04 06:55:05,472 INFO L124 PetriNetUnfolderBase]: 30/414 cut-off events. [2023-08-04 06:55:05,473 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:55:05,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 414 events. 30/414 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1842 event pairs, 0 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 243. Up to 16 conditions per place. [2023-08-04 06:55:05,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 106 transitions, 227 flow [2023-08-04 06:55:05,475 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 171 flow [2023-08-04 06:55:05,475 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:55:05,475 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 171 flow [2023-08-04 06:55:05,476 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 171 flow [2023-08-04 06:55:05,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 171 flow [2023-08-04 06:55:05,491 INFO L124 PetriNetUnfolderBase]: 6/190 cut-off events. [2023-08-04 06:55:05,491 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:55:05,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 190 events. 6/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 585 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 131. Up to 8 conditions per place. [2023-08-04 06:55:05,493 INFO L119 LiptonReduction]: Number of co-enabled transitions 1116 [2023-08-04 06:55:06,932 INFO L134 LiptonReduction]: Checked pairs total: 2194 [2023-08-04 06:55:06,932 INFO L136 LiptonReduction]: Total number of compositions: 60 [2023-08-04 06:55:06,934 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 06:55:06,935 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;@63fbf8e1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:55:06,935 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 06:55:06,937 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:55:06,938 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-08-04 06:55:06,938 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:55:06,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:55:06,938 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 06:55:06,938 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 06:55:06,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:55:06,939 INFO L85 PathProgramCache]: Analyzing trace with hash -61867689, now seen corresponding path program 1 times [2023-08-04 06:55:06,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:55:06,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166426113] [2023-08-04 06:55:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:55:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:55:06,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:55:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:55:06,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:55:06,969 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:55:06,969 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 06:55:06,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 06:55:06,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 06:55:06,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 06:55:06,970 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 06:55:06,970 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 06:55:06,971 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 06:55:06,971 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 06:55:06,988 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:55:06,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 290 flow [2023-08-04 06:55:07,087 INFO L124 PetriNetUnfolderBase]: 93/1304 cut-off events. [2023-08-04 06:55:07,087 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 06:55:07,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 1304 events. 93/1304 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8852 event pairs, 0 based on Foata normal form. 0/1145 useless extension candidates. Maximal degree in co-relation 945. Up to 54 conditions per place. [2023-08-04 06:55:07,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 290 flow [2023-08-04 06:55:07,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 112 transitions, 248 flow [2023-08-04 06:55:07,093 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:55:07,093 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 112 transitions, 248 flow [2023-08-04 06:55:07,094 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 112 transitions, 248 flow [2023-08-04 06:55:07,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 112 transitions, 248 flow [2023-08-04 06:55:07,159 INFO L124 PetriNetUnfolderBase]: 66/967 cut-off events. [2023-08-04 06:55:07,160 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-04 06:55:07,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 967 events. 66/967 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5981 event pairs, 0 based on Foata normal form. 0/862 useless extension candidates. Maximal degree in co-relation 717. Up to 54 conditions per place. [2023-08-04 06:55:07,176 INFO L119 LiptonReduction]: Number of co-enabled transitions 3996 [2023-08-04 06:55:08,905 INFO L134 LiptonReduction]: Checked pairs total: 8213 [2023-08-04 06:55:08,906 INFO L136 LiptonReduction]: Total number of compositions: 83 [2023-08-04 06:55:08,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:55:08,908 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;@63fbf8e1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:55:08,908 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 06:55:08,911 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:55:08,911 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-08-04 06:55:08,911 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:55:08,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:55:08,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:55:08,911 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:55:08,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:55:08,912 INFO L85 PathProgramCache]: Analyzing trace with hash 635137405, now seen corresponding path program 1 times [2023-08-04 06:55:08,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:55:08,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063784788] [2023-08-04 06:55:08,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:08,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:55:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:08,940 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 06:55:08,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:55:08,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063784788] [2023-08-04 06:55:08,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063784788] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:55:08,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:55:08,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:55:08,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498329457] [2023-08-04 06:55:08,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:55:08,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:55:08,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:55:08,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:55:08,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:55:08,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 210 [2023-08-04 06:55:08,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 102 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 06:55:08,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:55:08,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 210 [2023-08-04 06:55:08,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:55:12,531 INFO L124 PetriNetUnfolderBase]: 33046/47771 cut-off events. [2023-08-04 06:55:12,531 INFO L125 PetriNetUnfolderBase]: For 1425/1425 co-relation queries the response was YES. [2023-08-04 06:55:12,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93162 conditions, 47771 events. 33046/47771 cut-off events. For 1425/1425 co-relation queries the response was YES. Maximal size of possible extension queue 1625. Compared 334506 event pairs, 26064 based on Foata normal form. 0/45422 useless extension candidates. Maximal degree in co-relation 26554. Up to 43520 conditions per place. [2023-08-04 06:55:12,811 INFO L140 encePairwiseOnDemand]: 206/210 looper letters, 31 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-04 06:55:12,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 174 flow [2023-08-04 06:55:12,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:55:12,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:55:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-04 06:55:12,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5841269841269842 [2023-08-04 06:55:12,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-04 06:55:12,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-04 06:55:12,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:55:12,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-04 06:55:12,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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 06:55:12,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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 06:55:12,820 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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 06:55:12,820 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 102 flow. Second operand 3 states and 368 transitions. [2023-08-04 06:55:12,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 174 flow [2023-08-04 06:55:12,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:55:12,822 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 112 flow [2023-08-04 06:55:12,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=112, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-04 06:55:12,824 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-04 06:55:12,824 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 112 flow [2023-08-04 06:55:12,825 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 06:55:12,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:55:12,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:55:12,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 06:55:12,825 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:55:12,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:55:12,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1304025778, now seen corresponding path program 1 times [2023-08-04 06:55:12,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:55:12,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393531035] [2023-08-04 06:55:12,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:12,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:55:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:12,873 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 06:55:12,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:55:12,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393531035] [2023-08-04 06:55:12,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393531035] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:55:12,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829039258] [2023-08-04 06:55:12,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:12,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:55:12,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:55:12,876 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 06:55:12,895 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 06:55:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:12,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:55:12,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:55:12,953 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 06:55:12,953 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:55:12,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829039258] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:55:12,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:55:12,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:55:12,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829628905] [2023-08-04 06:55:12,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:55:12,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:55:12,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:55:12,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:55:12,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:55:12,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 210 [2023-08-04 06:55:12,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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 06:55:12,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:55:12,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 210 [2023-08-04 06:55:12,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:55:15,511 INFO L124 PetriNetUnfolderBase]: 31406/44873 cut-off events. [2023-08-04 06:55:15,512 INFO L125 PetriNetUnfolderBase]: For 1143/1143 co-relation queries the response was YES. [2023-08-04 06:55:15,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87754 conditions, 44873 events. 31406/44873 cut-off events. For 1143/1143 co-relation queries the response was YES. Maximal size of possible extension queue 1588. Compared 307341 event pairs, 24928 based on Foata normal form. 0/42773 useless extension candidates. Maximal degree in co-relation 87717. Up to 40987 conditions per place. [2023-08-04 06:55:15,719 INFO L140 encePairwiseOnDemand]: 207/210 looper letters, 36 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-04 06:55:15,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 204 flow [2023-08-04 06:55:15,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:55:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:55:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-08-04 06:55:15,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2023-08-04 06:55:15,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-08-04 06:55:15,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-08-04 06:55:15,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:55:15,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-08-04 06:55:15,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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 06:55:15,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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 06:55:15,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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 06:55:15,725 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 112 flow. Second operand 3 states and 371 transitions. [2023-08-04 06:55:15,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 204 flow [2023-08-04 06:55:15,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:55:15,727 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 122 flow [2023-08-04 06:55:15,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2023-08-04 06:55:15,728 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2023-08-04 06:55:15,728 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 122 flow [2023-08-04 06:55:15,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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 06:55:15,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:55:15,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:55:15,734 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 06:55:15,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:55:15,934 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:55:15,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:55:15,935 INFO L85 PathProgramCache]: Analyzing trace with hash -226714101, now seen corresponding path program 1 times [2023-08-04 06:55:15,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:55:15,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954694855] [2023-08-04 06:55:15,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:15,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:55:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:15,996 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 06:55:15,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:55:15,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954694855] [2023-08-04 06:55:15,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954694855] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:55:15,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945327873] [2023-08-04 06:55:15,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:15,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:55:15,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:55:15,999 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 06:55:16,002 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 06:55:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:16,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:55:16,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:55:16,079 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 06:55:16,079 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:55:16,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945327873] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:55:16,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:55:16,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:55:16,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836282915] [2023-08-04 06:55:16,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:55:16,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:55:16,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:55:16,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:55:16,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:55:16,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 210 [2023-08-04 06:55:16,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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 06:55:16,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:55:16,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 210 [2023-08-04 06:55:16,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:55:18,622 INFO L124 PetriNetUnfolderBase]: 30734/43358 cut-off events. [2023-08-04 06:55:18,622 INFO L125 PetriNetUnfolderBase]: For 833/833 co-relation queries the response was YES. [2023-08-04 06:55:18,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85613 conditions, 43358 events. 30734/43358 cut-off events. For 833/833 co-relation queries the response was YES. Maximal size of possible extension queue 1567. Compared 290758 event pairs, 23582 based on Foata normal form. 0/41615 useless extension candidates. Maximal degree in co-relation 24344. Up to 37757 conditions per place. [2023-08-04 06:55:18,829 INFO L140 encePairwiseOnDemand]: 207/210 looper letters, 41 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-04 06:55:18,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 232 flow [2023-08-04 06:55:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:55:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:55:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-04 06:55:18,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2023-08-04 06:55:18,831 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-04 06:55:18,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-04 06:55:18,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:55:18,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-04 06:55:18,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 06:55:18,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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 06:55:18,834 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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 06:55:18,834 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 122 flow. Second operand 3 states and 375 transitions. [2023-08-04 06:55:18,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 232 flow [2023-08-04 06:55:18,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:55:18,837 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 132 flow [2023-08-04 06:55:18,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-08-04 06:55:18,838 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-04 06:55:18,838 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 132 flow [2023-08-04 06:55:18,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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 06:55:18,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:55:18,839 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 06:55:18,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 06:55:19,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:55:19,047 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:55:19,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:55:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash -274389445, now seen corresponding path program 1 times [2023-08-04 06:55:19,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:55:19,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776142559] [2023-08-04 06:55:19,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:19,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:55:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:19,103 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 06:55:19,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:55:19,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776142559] [2023-08-04 06:55:19,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776142559] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:55:19,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64945597] [2023-08-04 06:55:19,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:19,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:55:19,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:55:19,105 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 06:55:19,108 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 06:55:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:19,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:55:19,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:55:19,187 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 06:55:19,187 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:55:19,199 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 06:55:19,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64945597] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:55:19,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:55:19,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:55:19,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212870600] [2023-08-04 06:55:19,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:55:19,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:55:19,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:55:19,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:55:19,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:55:19,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 210 [2023-08-04 06:55:19,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 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 06:55:19,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:55:19,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 210 [2023-08-04 06:55:19,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:55:21,370 INFO L124 PetriNetUnfolderBase]: 24232/33893 cut-off events. [2023-08-04 06:55:21,371 INFO L125 PetriNetUnfolderBase]: For 3624/3624 co-relation queries the response was YES. [2023-08-04 06:55:21,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69782 conditions, 33893 events. 24232/33893 cut-off events. For 3624/3624 co-relation queries the response was YES. Maximal size of possible extension queue 1259. Compared 214196 event pairs, 14820 based on Foata normal form. 3/33860 useless extension candidates. Maximal degree in co-relation 24810. Up to 31258 conditions per place. [2023-08-04 06:55:21,542 INFO L140 encePairwiseOnDemand]: 206/210 looper letters, 36 selfloop transitions, 3 changer transitions 1/49 dead transitions. [2023-08-04 06:55:21,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 228 flow [2023-08-04 06:55:21,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:55:21,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:55:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-08-04 06:55:21,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5702380952380952 [2023-08-04 06:55:21,546 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-08-04 06:55:21,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-08-04 06:55:21,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:55:21,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-08-04 06:55:21,548 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 06:55:21,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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 06:55:21,551 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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 06:55:21,551 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 132 flow. Second operand 4 states and 479 transitions. [2023-08-04 06:55:21,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 228 flow [2023-08-04 06:55:21,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 49 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:55:21,557 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 144 flow [2023-08-04 06:55:21,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2023-08-04 06:55:21,559 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-04 06:55:21,559 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 144 flow [2023-08-04 06:55:21,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 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 06:55:21,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:55:21,559 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 06:55:21,567 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 06:55:21,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:55:21,765 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:55:21,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:55:21,766 INFO L85 PathProgramCache]: Analyzing trace with hash -376891699, now seen corresponding path program 1 times [2023-08-04 06:55:21,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:55:21,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590197712] [2023-08-04 06:55:21,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:21,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:55:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:21,822 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 06:55:21,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:55:21,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590197712] [2023-08-04 06:55:21,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590197712] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:55:21,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709620487] [2023-08-04 06:55:21,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:21,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:55:21,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:55:21,824 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 06:55:21,827 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 06:55:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:21,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:55:21,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:55:21,918 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 06:55:21,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:55:21,933 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 06:55:21,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709620487] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:55:21,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:55:21,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 06:55:21,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159953412] [2023-08-04 06:55:21,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:55:21,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:55:21,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:55:21,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:55:21,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:55:21,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 210 [2023-08-04 06:55:21,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 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 06:55:21,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:55:21,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 210 [2023-08-04 06:55:21,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:55:23,560 INFO L124 PetriNetUnfolderBase]: 19198/26485 cut-off events. [2023-08-04 06:55:23,561 INFO L125 PetriNetUnfolderBase]: For 2439/2439 co-relation queries the response was YES. [2023-08-04 06:55:23,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54371 conditions, 26485 events. 19198/26485 cut-off events. For 2439/2439 co-relation queries the response was YES. Maximal size of possible extension queue 1127. Compared 160229 event pairs, 11902 based on Foata normal form. 27/26503 useless extension candidates. Maximal degree in co-relation 19295. Up to 23785 conditions per place. [2023-08-04 06:55:23,671 INFO L140 encePairwiseOnDemand]: 206/210 looper letters, 44 selfloop transitions, 3 changer transitions 1/57 dead transitions. [2023-08-04 06:55:23,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 272 flow [2023-08-04 06:55:23,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:55:23,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:55:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-08-04 06:55:23,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5797619047619048 [2023-08-04 06:55:23,673 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-08-04 06:55:23,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-08-04 06:55:23,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:55:23,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-08-04 06:55:23,675 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 06:55:23,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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 06:55:23,677 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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 06:55:23,677 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 144 flow. Second operand 4 states and 487 transitions. [2023-08-04 06:55:23,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 272 flow [2023-08-04 06:55:23,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 57 transitions, 265 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 06:55:23,681 INFO L231 Difference]: Finished difference. Result has 64 places, 41 transitions, 151 flow [2023-08-04 06:55:23,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=64, PETRI_TRANSITIONS=41} [2023-08-04 06:55:23,682 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2023-08-04 06:55:23,682 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 41 transitions, 151 flow [2023-08-04 06:55:23,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 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 06:55:23,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:55:23,682 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 06:55:23,689 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 06:55:23,887 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 06:55:23,887 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:55:23,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:55:23,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1490527575, now seen corresponding path program 1 times [2023-08-04 06:55:23,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:55:23,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640330499] [2023-08-04 06:55:23,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:23,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:55:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:23,940 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 06:55:23,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:55:23,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640330499] [2023-08-04 06:55:23,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640330499] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:55:23,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984780265] [2023-08-04 06:55:23,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:23,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:55:23,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:55:23,942 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 06:55:23,945 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 06:55:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:24,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:55:24,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:55:24,049 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 06:55:24,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:55:24,061 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 06:55:24,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984780265] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:55:24,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:55:24,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 06:55:24,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164568289] [2023-08-04 06:55:24,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:55:24,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:55:24,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:55:24,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:55:24,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:55:24,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 210 [2023-08-04 06:55:24,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 41 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 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 06:55:24,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:55:24,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 210 [2023-08-04 06:55:24,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:55:25,408 INFO L124 PetriNetUnfolderBase]: 17362/23209 cut-off events. [2023-08-04 06:55:25,408 INFO L125 PetriNetUnfolderBase]: For 2377/2377 co-relation queries the response was YES. [2023-08-04 06:55:25,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48754 conditions, 23209 events. 17362/23209 cut-off events. For 2377/2377 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 128338 event pairs, 6886 based on Foata normal form. 243/23443 useless extension candidates. Maximal degree in co-relation 17297. Up to 11794 conditions per place. [2023-08-04 06:55:25,486 INFO L140 encePairwiseOnDemand]: 206/210 looper letters, 52 selfloop transitions, 3 changer transitions 1/65 dead transitions. [2023-08-04 06:55:25,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 311 flow [2023-08-04 06:55:25,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:55:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:55:25,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2023-08-04 06:55:25,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2023-08-04 06:55:25,488 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 495 transitions. [2023-08-04 06:55:25,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 495 transitions. [2023-08-04 06:55:25,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:55:25,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 495 transitions. [2023-08-04 06:55:25,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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 06:55:25,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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 06:55:25,492 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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 06:55:25,492 INFO L175 Difference]: Start difference. First operand has 64 places, 41 transitions, 151 flow. Second operand 4 states and 495 transitions. [2023-08-04 06:55:25,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 311 flow [2023-08-04 06:55:25,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 65 transitions, 304 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 06:55:25,495 INFO L231 Difference]: Finished difference. Result has 66 places, 41 transitions, 158 flow [2023-08-04 06:55:25,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=66, PETRI_TRANSITIONS=41} [2023-08-04 06:55:25,496 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2023-08-04 06:55:25,496 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 41 transitions, 158 flow [2023-08-04 06:55:25,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 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 06:55:25,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:55:25,496 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 06:55:25,503 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 06:55:25,700 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 06:55:25,700 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:55:25,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:55:25,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1194099878, now seen corresponding path program 1 times [2023-08-04 06:55:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:55:25,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126810296] [2023-08-04 06:55:25,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:25,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:55:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:25,884 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 06:55:25,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:55:25,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126810296] [2023-08-04 06:55:25,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126810296] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:55:25,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:55:25,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:55:25,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421264577] [2023-08-04 06:55:25,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:55:25,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:55:25,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:55:25,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:55:25,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:55:25,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 210 [2023-08-04 06:55:25,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 41 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 06:55:25,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:55:25,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 210 [2023-08-04 06:55:25,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:55:32,825 INFO L124 PetriNetUnfolderBase]: 87958/116172 cut-off events. [2023-08-04 06:55:32,826 INFO L125 PetriNetUnfolderBase]: For 55548/55548 co-relation queries the response was YES. [2023-08-04 06:55:33,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261824 conditions, 116172 events. 87958/116172 cut-off events. For 55548/55548 co-relation queries the response was YES. Maximal size of possible extension queue 4049. Compared 723957 event pairs, 34741 based on Foata normal form. 1981/117789 useless extension candidates. Maximal degree in co-relation 164867. Up to 64721 conditions per place. [2023-08-04 06:55:33,429 INFO L140 encePairwiseOnDemand]: 198/210 looper letters, 58 selfloop transitions, 11 changer transitions 0/74 dead transitions. [2023-08-04 06:55:33,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 74 transitions, 432 flow [2023-08-04 06:55:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:55:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:55:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-04 06:55:33,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5825396825396826 [2023-08-04 06:55:33,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-04 06:55:33,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-04 06:55:33,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:55:33,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-04 06:55:33,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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 06:55:33,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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 06:55:33,434 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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 06:55:33,434 INFO L175 Difference]: Start difference. First operand has 66 places, 41 transitions, 158 flow. Second operand 3 states and 367 transitions. [2023-08-04 06:55:33,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 74 transitions, 432 flow [2023-08-04 06:55:33,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 418 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 06:55:33,731 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 237 flow [2023-08-04 06:55:33,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2023-08-04 06:55:33,731 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2023-08-04 06:55:33,731 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 237 flow [2023-08-04 06:55:33,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 06:55:33,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:55:33,732 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 06:55:33,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-04 06:55:33,732 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:55:33,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:55:33,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1637608683, now seen corresponding path program 1 times [2023-08-04 06:55:33,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:55:33,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915244400] [2023-08-04 06:55:33,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:33,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:55:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:34,088 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 06:55:34,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:55:34,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915244400] [2023-08-04 06:55:34,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915244400] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:55:34,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:55:34,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:55:34,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349752381] [2023-08-04 06:55:34,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:55:34,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 06:55:34,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:55:34,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 06:55:34,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 06:55:34,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 210 [2023-08-04 06:55:34,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 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 06:55:34,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:55:34,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 210 [2023-08-04 06:55:34,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:55:48,142 INFO L124 PetriNetUnfolderBase]: 186518/234313 cut-off events. [2023-08-04 06:55:48,142 INFO L125 PetriNetUnfolderBase]: For 268911/268911 co-relation queries the response was YES. [2023-08-04 06:55:48,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691869 conditions, 234313 events. 186518/234313 cut-off events. For 268911/268911 co-relation queries the response was YES. Maximal size of possible extension queue 6391. Compared 1314966 event pairs, 20627 based on Foata normal form. 1792/236075 useless extension candidates. Maximal degree in co-relation 301343. Up to 84824 conditions per place. [2023-08-04 06:55:49,406 INFO L140 encePairwiseOnDemand]: 196/210 looper letters, 95 selfloop transitions, 35 changer transitions 0/133 dead transitions. [2023-08-04 06:55:49,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 133 transitions, 853 flow [2023-08-04 06:55:49,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 06:55:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 06:55:49,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2023-08-04 06:55:49,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2023-08-04 06:55:49,408 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 595 transitions. [2023-08-04 06:55:49,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 595 transitions. [2023-08-04 06:55:49,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:55:49,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 595 transitions. [2023-08-04 06:55:49,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 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 06:55:49,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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 06:55:49,412 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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 06:55:49,412 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 237 flow. Second operand 5 states and 595 transitions. [2023-08-04 06:55:49,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 133 transitions, 853 flow [2023-08-04 06:55:49,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 133 transitions, 795 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 06:55:49,897 INFO L231 Difference]: Finished difference. Result has 73 places, 81 transitions, 523 flow [2023-08-04 06:55:49,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=523, PETRI_PLACES=73, PETRI_TRANSITIONS=81} [2023-08-04 06:55:49,897 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2023-08-04 06:55:49,897 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 81 transitions, 523 flow [2023-08-04 06:55:49,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 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 06:55:49,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:55:49,898 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 06:55:49,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-04 06:55:49,898 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:55:49,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:55:49,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1637608590, now seen corresponding path program 1 times [2023-08-04 06:55:49,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:55:49,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073827324] [2023-08-04 06:55:49,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:55:49,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:55:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:55:50,216 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 06:55:50,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:55:50,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073827324] [2023-08-04 06:55:50,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073827324] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:55:50,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:55:50,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:55:50,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281516774] [2023-08-04 06:55:50,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:55:50,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 06:55:50,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:55:50,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 06:55:50,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 06:55:50,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 210 [2023-08-04 06:55:50,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 81 transitions, 523 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 06:55:50,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:55:50,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 210 [2023-08-04 06:55:50,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:56:04,273 INFO L124 PetriNetUnfolderBase]: 158025/202588 cut-off events. [2023-08-04 06:56:04,274 INFO L125 PetriNetUnfolderBase]: For 425418/433832 co-relation queries the response was YES. [2023-08-04 06:56:04,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750780 conditions, 202588 events. 158025/202588 cut-off events. For 425418/433832 co-relation queries the response was YES. Maximal size of possible extension queue 6883. Compared 1246878 event pairs, 19783 based on Foata normal form. 4873/201206 useless extension candidates. Maximal degree in co-relation 750668. Up to 109342 conditions per place. [2023-08-04 06:56:06,095 INFO L140 encePairwiseOnDemand]: 198/210 looper letters, 109 selfloop transitions, 33 changer transitions 0/151 dead transitions. [2023-08-04 06:56:06,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 151 transitions, 1217 flow [2023-08-04 06:56:06,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:56:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:56:06,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2023-08-04 06:56:06,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5880952380952381 [2023-08-04 06:56:06,097 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 494 transitions. [2023-08-04 06:56:06,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 494 transitions. [2023-08-04 06:56:06,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:56:06,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 494 transitions. [2023-08-04 06:56:06,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 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 06:56:06,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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 06:56:06,100 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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 06:56:06,100 INFO L175 Difference]: Start difference. First operand has 73 places, 81 transitions, 523 flow. Second operand 4 states and 494 transitions. [2023-08-04 06:56:06,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 151 transitions, 1217 flow [2023-08-04 06:56:10,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 151 transitions, 1217 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:56:10,757 INFO L231 Difference]: Finished difference. Result has 79 places, 101 transitions, 845 flow [2023-08-04 06:56:10,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=845, PETRI_PLACES=79, PETRI_TRANSITIONS=101} [2023-08-04 06:56:10,758 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2023-08-04 06:56:10,758 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 101 transitions, 845 flow [2023-08-04 06:56:10,758 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 06:56:10,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:56:10,758 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 06:56:10,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-04 06:56:10,759 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:56:10,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:56:10,759 INFO L85 PathProgramCache]: Analyzing trace with hash -773739235, now seen corresponding path program 1 times [2023-08-04 06:56:10,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:56:10,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611731442] [2023-08-04 06:56:10,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:56:10,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:56:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:56:10,876 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 06:56:10,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:56:10,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611731442] [2023-08-04 06:56:10,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611731442] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:56:10,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:56:10,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:56:10,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302167414] [2023-08-04 06:56:10,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:56:10,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 06:56:10,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:56:10,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 06:56:10,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 06:56:10,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 210 [2023-08-04 06:56:10,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 101 transitions, 845 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 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 06:56:10,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:56:10,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 210 [2023-08-04 06:56:10,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:56:31,343 INFO L124 PetriNetUnfolderBase]: 196618/256977 cut-off events. [2023-08-04 06:56:31,343 INFO L125 PetriNetUnfolderBase]: For 915773/944219 co-relation queries the response was YES. [2023-08-04 06:56:32,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019193 conditions, 256977 events. 196618/256977 cut-off events. For 915773/944219 co-relation queries the response was YES. Maximal size of possible extension queue 9250. Compared 1712089 event pairs, 27763 based on Foata normal form. 10136/263104 useless extension candidates. Maximal degree in co-relation 701384. Up to 94771 conditions per place. [2023-08-04 06:56:33,491 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 97 selfloop transitions, 15 changer transitions 6/143 dead transitions. [2023-08-04 06:56:33,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 143 transitions, 1351 flow [2023-08-04 06:56:33,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:56:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:56:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2023-08-04 06:56:33,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5988095238095238 [2023-08-04 06:56:33,493 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 503 transitions. [2023-08-04 06:56:33,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 503 transitions. [2023-08-04 06:56:33,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:56:33,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 503 transitions. [2023-08-04 06:56:33,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 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 06:56:33,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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 06:56:33,496 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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 06:56:33,496 INFO L175 Difference]: Start difference. First operand has 79 places, 101 transitions, 845 flow. Second operand 4 states and 503 transitions. [2023-08-04 06:56:33,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 143 transitions, 1351 flow [2023-08-04 06:56:38,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 143 transitions, 1351 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:56:38,252 INFO L231 Difference]: Finished difference. Result has 84 places, 101 transitions, 910 flow [2023-08-04 06:56:38,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=910, PETRI_PLACES=84, PETRI_TRANSITIONS=101} [2023-08-04 06:56:38,253 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 33 predicate places. [2023-08-04 06:56:38,253 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 101 transitions, 910 flow [2023-08-04 06:56:38,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 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 06:56:38,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:56:38,253 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] [2023-08-04 06:56:38,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 06:56:38,253 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:56:38,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:56:38,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1901151068, now seen corresponding path program 1 times [2023-08-04 06:56:38,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:56:38,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426267625] [2023-08-04 06:56:38,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:56:38,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:56:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:56:38,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 06:56:38,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:56:38,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426267625] [2023-08-04 06:56:38,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426267625] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:56:38,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516197341] [2023-08-04 06:56:38,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:56:38,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:56:38,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:56:38,390 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 06:56:38,391 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 06:56:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:56:38,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-04 06:56:38,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:56:38,523 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 06:56:38,523 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:56:38,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516197341] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:56:38,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:56:38,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 06:56:38,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814290744] [2023-08-04 06:56:38,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:56:38,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:56:38,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:56:38,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:56:38,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-04 06:56:38,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 210 [2023-08-04 06:56:38,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 101 transitions, 910 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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 06:56:38,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:56:38,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 210 [2023-08-04 06:56:38,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:56:43,638 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] $Ultimate##0-->L726: Formula: (and (= v_~y~0_28 v_~__unbuffered_p0_EAX~0_34) (= v_P0Thread1of2ForFork0_~arg.base_5 |v_P0Thread1of2ForFork0_#in~arg.base_5|) (= v_P0Thread1of2ForFork0_~arg.offset_5 |v_P0Thread1of2ForFork0_#in~arg.offset_5|)) InVars {P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, P0Thread1of2ForFork0_~arg.base=v_P0Thread1of2ForFork0_~arg.base_5, P0Thread1of2ForFork0_~arg.offset=v_P0Thread1of2ForFork0_~arg.offset_5, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of2ForFork0_~arg.base, P0Thread1of2ForFork0_~arg.offset][111], [P0Thread2of2ForFork0InUse, 30#$Ultimate##0true, P1Thread1of2ForFork1InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 94#L726true, 119#P1EXITtrue, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 26#L744true, 626#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 117#L783-6true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 17#L756true, Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), 635#true, P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 55#L759true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:43,639 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 06:56:43,639 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 06:56:43,639 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 06:56:43,639 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 06:56:43,639 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] $Ultimate##0-->L726: Formula: (and (= v_P0Thread2of2ForFork0_~arg.offset_5 |v_P0Thread2of2ForFork0_#in~arg.offset_5|) (= v_P0Thread2of2ForFork0_~arg.base_5 |v_P0Thread2of2ForFork0_#in~arg.base_5|) (= v_~y~0_24 v_~__unbuffered_p0_EAX~0_32)) InVars {P0Thread2of2ForFork0_#in~arg.offset=|v_P0Thread2of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_24, P0Thread2of2ForFork0_#in~arg.base=|v_P0Thread2of2ForFork0_#in~arg.base_5|} OutVars{P0Thread2of2ForFork0_~arg.offset=v_P0Thread2of2ForFork0_~arg.offset_5, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, P0Thread2of2ForFork0_~arg.base=v_P0Thread2of2ForFork0_~arg.base_5, P0Thread2of2ForFork0_#in~arg.offset=|v_P0Thread2of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_24, P0Thread2of2ForFork0_#in~arg.base=|v_P0Thread2of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P0Thread2of2ForFork0_~arg.offset, ~__unbuffered_p0_EAX~0, P0Thread2of2ForFork0_~arg.base][112], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 119#P1EXITtrue, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 121#L726true, 607#true, 26#L744true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 626#true, Black: 609#(= ~y~0 0), 80#$Ultimate##0true, Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 117#L783-6true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 17#L756true, Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), 635#true, P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 55#L759true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:43,639 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 06:56:43,639 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 06:56:43,639 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 06:56:43,639 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 06:56:44,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] $Ultimate##0-->L756: Formula: (and (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5) (= v_~x~0_45 v_~__unbuffered_p2_EAX~0_38)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_45} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_45, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][150], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 114#L741true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 56#L741true, 643#(<= ~__unbuffered_cnt~0 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 62#L729true, 100#L729true, 117#L783-6true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 17#L756true, Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), P0Thread1of2ForFork0InUse, 55#L759true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:44,277 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2023-08-04 06:56:44,277 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 06:56:44,277 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 06:56:44,277 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 06:56:44,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] $Ultimate##0-->L756: Formula: (and (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5) (= v_~x~0_45 v_~__unbuffered_p2_EAX~0_38)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_45} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_45, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][156], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 114#L741true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 56#L741true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 100#L729true, 117#L783-6true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 17#L756true, Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), 11#P0EXITtrue, P0Thread1of2ForFork0InUse, 635#true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 55#L759true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:44,277 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-04 06:56:44,277 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 06:56:44,277 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 06:56:44,277 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 06:56:47,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] $Ultimate##0-->L726: Formula: (and (= v_~y~0_28 v_~__unbuffered_p0_EAX~0_34) (= v_P0Thread1of2ForFork0_~arg.base_5 |v_P0Thread1of2ForFork0_#in~arg.base_5|) (= v_P0Thread1of2ForFork0_~arg.offset_5 |v_P0Thread1of2ForFork0_#in~arg.offset_5|)) InVars {P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, P0Thread1of2ForFork0_~arg.base=v_P0Thread1of2ForFork0_~arg.base_5, P0Thread1of2ForFork0_~arg.offset=v_P0Thread1of2ForFork0_~arg.offset_5, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of2ForFork0_~arg.base, P0Thread1of2ForFork0_~arg.offset][111], [P0Thread2of2ForFork0InUse, 30#$Ultimate##0true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, 88#L783-11true, P2Thread2of2ForFork2InUse, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 119#P1EXITtrue, 94#L726true, 618#true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 26#L744true, 626#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 17#L756true, Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), P0Thread1of2ForFork0InUse, 635#true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 55#L759true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:47,013 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-04 06:56:47,013 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 06:56:47,013 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 06:56:47,013 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 06:56:47,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] $Ultimate##0-->L726: Formula: (and (= v_P0Thread2of2ForFork0_~arg.offset_5 |v_P0Thread2of2ForFork0_#in~arg.offset_5|) (= v_P0Thread2of2ForFork0_~arg.base_5 |v_P0Thread2of2ForFork0_#in~arg.base_5|) (= v_~y~0_24 v_~__unbuffered_p0_EAX~0_32)) InVars {P0Thread2of2ForFork0_#in~arg.offset=|v_P0Thread2of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_24, P0Thread2of2ForFork0_#in~arg.base=|v_P0Thread2of2ForFork0_#in~arg.base_5|} OutVars{P0Thread2of2ForFork0_~arg.offset=v_P0Thread2of2ForFork0_~arg.offset_5, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, P0Thread2of2ForFork0_~arg.base=v_P0Thread2of2ForFork0_~arg.base_5, P0Thread2of2ForFork0_#in~arg.offset=|v_P0Thread2of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_24, P0Thread2of2ForFork0_#in~arg.base=|v_P0Thread2of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P0Thread2of2ForFork0_~arg.offset, ~__unbuffered_p0_EAX~0, P0Thread2of2ForFork0_~arg.base][112], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, 88#L783-11true, P2Thread2of2ForFork2InUse, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 119#P1EXITtrue, 618#true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 121#L726true, 607#true, 26#L744true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 626#true, Black: 609#(= ~y~0 0), 80#$Ultimate##0true, Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 17#L756true, Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), P0Thread1of2ForFork0InUse, 635#true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 55#L759true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:47,013 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-04 06:56:47,013 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 06:56:47,014 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 06:56:47,014 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 06:56:47,213 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] $Ultimate##0-->L756: Formula: (and (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5) (= v_~x~0_45 v_~__unbuffered_p2_EAX~0_38)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_45} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_45, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][156], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, 20#$Ultimate##0true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 56#L741true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 124#L788true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 100#L729true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 17#L756true, 11#P0EXITtrue, Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), 635#true, P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 55#L759true]) [2023-08-04 06:56:47,213 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,213 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,213 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,213 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] $Ultimate##0-->L756: Formula: (and (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5) (= v_~x~0_45 v_~__unbuffered_p2_EAX~0_38)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_45} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_45, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][156], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, 114#L741true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 124#L788true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 3#$Ultimate##0true, 100#L729true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 17#L756true, 11#P0EXITtrue, Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), 635#true, P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 55#L759true]) [2023-08-04 06:56:47,214 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,214 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,214 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,214 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] $Ultimate##0-->L756: Formula: (and (= v_~x~0_43 v_~__unbuffered_p2_EAX~0_36) (= v_P2Thread1of2ForFork2_~arg.base_5 |v_P2Thread1of2ForFork2_#in~arg.base_5|) (= |v_P2Thread1of2ForFork2_#in~arg.offset_5| v_P2Thread1of2ForFork2_~arg.offset_5)) InVars {P2Thread1of2ForFork2_#in~arg.offset=|v_P2Thread1of2ForFork2_#in~arg.offset_5|, P2Thread1of2ForFork2_#in~arg.base=|v_P2Thread1of2ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_43} OutVars{P2Thread1of2ForFork2_#in~arg.offset=|v_P2Thread1of2ForFork2_#in~arg.offset_5|, P2Thread1of2ForFork2_~arg.base=v_P2Thread1of2ForFork2_~arg.base_5, P2Thread1of2ForFork2_#in~arg.base=|v_P2Thread1of2ForFork2_#in~arg.base_5|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~x~0=v_~x~0_43, P2Thread1of2ForFork2_~arg.offset=v_P2Thread1of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread1of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of2ForFork2_~arg.offset][158], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, 20#$Ultimate##0true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 56#L741true, 95#L756true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 69#L759true, 124#L788true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 100#L729true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), 11#P0EXITtrue, P0Thread1of2ForFork0InUse, 635#true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:47,216 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,216 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,216 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,216 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] $Ultimate##0-->L756: Formula: (and (= v_~x~0_43 v_~__unbuffered_p2_EAX~0_36) (= v_P2Thread1of2ForFork2_~arg.base_5 |v_P2Thread1of2ForFork2_#in~arg.base_5|) (= |v_P2Thread1of2ForFork2_#in~arg.offset_5| v_P2Thread1of2ForFork2_~arg.offset_5)) InVars {P2Thread1of2ForFork2_#in~arg.offset=|v_P2Thread1of2ForFork2_#in~arg.offset_5|, P2Thread1of2ForFork2_#in~arg.base=|v_P2Thread1of2ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_43} OutVars{P2Thread1of2ForFork2_#in~arg.offset=|v_P2Thread1of2ForFork2_#in~arg.offset_5|, P2Thread1of2ForFork2_~arg.base=v_P2Thread1of2ForFork2_~arg.base_5, P2Thread1of2ForFork2_#in~arg.base=|v_P2Thread1of2ForFork2_#in~arg.base_5|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~x~0=v_~x~0_43, P2Thread1of2ForFork2_~arg.offset=v_P2Thread1of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread1of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of2ForFork2_~arg.offset][158], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, 114#L741true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 95#L756true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 69#L759true, 124#L788true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 3#$Ultimate##0true, 100#L729true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), 11#P0EXITtrue, 635#true, P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:47,217 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,217 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,217 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,217 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,473 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] $Ultimate##0-->L756: Formula: (and (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5) (= v_~x~0_45 v_~__unbuffered_p2_EAX~0_38)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_45} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_45, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][150], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, 114#L741true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, 88#L783-11true, P2Thread2of2ForFork2InUse, 56#L741true, 643#(<= ~__unbuffered_cnt~0 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 100#L729true, 62#L729true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 17#L756true, Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 55#L759true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:47,473 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-08-04 06:56:47,473 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 06:56:47,473 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 06:56:47,473 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 06:56:47,473 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] $Ultimate##0-->L756: Formula: (and (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5) (= v_~x~0_45 v_~__unbuffered_p2_EAX~0_38)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_45} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_45, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][156], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, 114#L741true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, 88#L783-11true, P2Thread2of2ForFork2InUse, 56#L741true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 100#L729true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 17#L756true, 11#P0EXITtrue, Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), P0Thread1of2ForFork0InUse, 635#true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 55#L759true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:47,473 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,473 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,474 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:47,474 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:48,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] $Ultimate##0-->L726: Formula: (and (= v_~y~0_28 v_~__unbuffered_p0_EAX~0_34) (= v_P0Thread1of2ForFork0_~arg.base_5 |v_P0Thread1of2ForFork0_#in~arg.base_5|) (= v_P0Thread1of2ForFork0_~arg.offset_5 |v_P0Thread1of2ForFork0_#in~arg.offset_5|)) InVars {P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, P0Thread1of2ForFork0_~arg.base=v_P0Thread1of2ForFork0_~arg.base_5, P0Thread1of2ForFork0_~arg.offset=v_P0Thread1of2ForFork0_~arg.offset_5, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of2ForFork0_~arg.base, P0Thread1of2ForFork0_~arg.offset][111], [P0Thread2of2ForFork0InUse, 30#$Ultimate##0true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 119#P1EXITtrue, 618#true, 94#L726true, 124#L788true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 26#L744true, 626#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 17#L756true, Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), P0Thread1of2ForFork0InUse, 635#true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 55#L759true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:48,735 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 06:56:48,735 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:48,735 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:48,735 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:48,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] $Ultimate##0-->L726: Formula: (and (= v_P0Thread2of2ForFork0_~arg.offset_5 |v_P0Thread2of2ForFork0_#in~arg.offset_5|) (= v_P0Thread2of2ForFork0_~arg.base_5 |v_P0Thread2of2ForFork0_#in~arg.base_5|) (= v_~y~0_24 v_~__unbuffered_p0_EAX~0_32)) InVars {P0Thread2of2ForFork0_#in~arg.offset=|v_P0Thread2of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_24, P0Thread2of2ForFork0_#in~arg.base=|v_P0Thread2of2ForFork0_#in~arg.base_5|} OutVars{P0Thread2of2ForFork0_~arg.offset=v_P0Thread2of2ForFork0_~arg.offset_5, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, P0Thread2of2ForFork0_~arg.base=v_P0Thread2of2ForFork0_~arg.base_5, P0Thread2of2ForFork0_#in~arg.offset=|v_P0Thread2of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_24, P0Thread2of2ForFork0_#in~arg.base=|v_P0Thread2of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P0Thread2of2ForFork0_~arg.offset, ~__unbuffered_p0_EAX~0, P0Thread2of2ForFork0_~arg.base][112], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 119#P1EXITtrue, 618#true, 124#L788true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 121#L726true, 607#true, 26#L744true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 626#true, Black: 609#(= ~y~0 0), 80#$Ultimate##0true, Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 17#L756true, Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), P0Thread1of2ForFork0InUse, 635#true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 55#L759true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:48,735 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 06:56:48,736 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:48,736 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:48,736 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:48,737 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] $Ultimate##0-->L726: Formula: (and (= v_~y~0_28 v_~__unbuffered_p0_EAX~0_34) (= v_P0Thread1of2ForFork0_~arg.base_5 |v_P0Thread1of2ForFork0_#in~arg.base_5|) (= v_P0Thread1of2ForFork0_~arg.offset_5 |v_P0Thread1of2ForFork0_#in~arg.offset_5|)) InVars {P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, P0Thread1of2ForFork0_~arg.base=v_P0Thread1of2ForFork0_~arg.base_5, P0Thread1of2ForFork0_~arg.offset=v_P0Thread1of2ForFork0_~arg.offset_5, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of2ForFork0_~arg.base, P0Thread1of2ForFork0_~arg.offset][111], [P0Thread2of2ForFork0InUse, 30#$Ultimate##0true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 95#L756true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 119#P1EXITtrue, 618#true, 94#L726true, 69#L759true, 124#L788true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 26#L744true, 626#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), P0Thread1of2ForFork0InUse, 635#true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:48,737 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 06:56:48,738 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:48,738 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:48,738 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:48,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] $Ultimate##0-->L726: Formula: (and (= v_P0Thread2of2ForFork0_~arg.offset_5 |v_P0Thread2of2ForFork0_#in~arg.offset_5|) (= v_P0Thread2of2ForFork0_~arg.base_5 |v_P0Thread2of2ForFork0_#in~arg.base_5|) (= v_~y~0_24 v_~__unbuffered_p0_EAX~0_32)) InVars {P0Thread2of2ForFork0_#in~arg.offset=|v_P0Thread2of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_24, P0Thread2of2ForFork0_#in~arg.base=|v_P0Thread2of2ForFork0_#in~arg.base_5|} OutVars{P0Thread2of2ForFork0_~arg.offset=v_P0Thread2of2ForFork0_~arg.offset_5, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, P0Thread2of2ForFork0_~arg.base=v_P0Thread2of2ForFork0_~arg.base_5, P0Thread2of2ForFork0_#in~arg.offset=|v_P0Thread2of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_24, P0Thread2of2ForFork0_#in~arg.base=|v_P0Thread2of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P0Thread2of2ForFork0_~arg.offset, ~__unbuffered_p0_EAX~0, P0Thread2of2ForFork0_~arg.base][112], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 95#L756true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 119#P1EXITtrue, 618#true, 69#L759true, 124#L788true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 121#L726true, 607#true, 26#L744true, 626#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), 80#$Ultimate##0true, Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), P0Thread1of2ForFork0InUse, 635#true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:48,738 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 06:56:48,738 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:48,738 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:48,738 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:56:49,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] $Ultimate##0-->L756: Formula: (and (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5) (= v_~x~0_45 v_~__unbuffered_p2_EAX~0_38)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_45} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_45, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][156], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, 114#L741true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 56#L741true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 124#L788true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 100#L729true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 17#L756true, Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), 11#P0EXITtrue, 635#true, P0Thread1of2ForFork0InUse, 55#L759true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:49,259 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 06:56:49,259 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:56:49,259 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:56:49,259 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:56:49,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] $Ultimate##0-->L756: Formula: (and (= v_~x~0_43 v_~__unbuffered_p2_EAX~0_36) (= v_P2Thread1of2ForFork2_~arg.base_5 |v_P2Thread1of2ForFork2_#in~arg.base_5|) (= |v_P2Thread1of2ForFork2_#in~arg.offset_5| v_P2Thread1of2ForFork2_~arg.offset_5)) InVars {P2Thread1of2ForFork2_#in~arg.offset=|v_P2Thread1of2ForFork2_#in~arg.offset_5|, P2Thread1of2ForFork2_#in~arg.base=|v_P2Thread1of2ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_43} OutVars{P2Thread1of2ForFork2_#in~arg.offset=|v_P2Thread1of2ForFork2_#in~arg.offset_5|, P2Thread1of2ForFork2_~arg.base=v_P2Thread1of2ForFork2_~arg.base_5, P2Thread1of2ForFork2_#in~arg.base=|v_P2Thread1of2ForFork2_#in~arg.base_5|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~x~0=v_~x~0_43, P2Thread1of2ForFork2_~arg.offset=v_P2Thread1of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread1of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of2ForFork2_~arg.offset][158], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, 114#L741true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 56#L741true, 95#L756true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 69#L759true, 124#L788true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 100#L729true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), 11#P0EXITtrue, 635#true, P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:49,261 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 06:56:49,261 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:56:49,261 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:56:49,261 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:56:51,556 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] $Ultimate##0-->L726: Formula: (and (= v_P0Thread2of2ForFork0_~arg.offset_5 |v_P0Thread2of2ForFork0_#in~arg.offset_5|) (= v_P0Thread2of2ForFork0_~arg.base_5 |v_P0Thread2of2ForFork0_#in~arg.base_5|) (= v_~y~0_24 v_~__unbuffered_p0_EAX~0_32)) InVars {P0Thread2of2ForFork0_#in~arg.offset=|v_P0Thread2of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_24, P0Thread2of2ForFork0_#in~arg.base=|v_P0Thread2of2ForFork0_#in~arg.base_5|} OutVars{P0Thread2of2ForFork0_~arg.offset=v_P0Thread2of2ForFork0_~arg.offset_5, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, P0Thread2of2ForFork0_~arg.base=v_P0Thread2of2ForFork0_~arg.base_5, P0Thread2of2ForFork0_#in~arg.offset=|v_P0Thread2of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_24, P0Thread2of2ForFork0_#in~arg.base=|v_P0Thread2of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P0Thread2of2ForFork0_~arg.offset, ~__unbuffered_p0_EAX~0, P0Thread2of2ForFork0_~arg.base][114], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 124#L788true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 121#L726true, 607#true, 26#L744true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 626#true, Black: 609#(= ~y~0 0), 41#L744true, Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 17#L756true, Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), 11#P0EXITtrue, P0Thread1of2ForFork0InUse, 635#true, 55#L759true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 06:56:51,556 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 06:56:51,556 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 06:56:51,556 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 06:56:51,556 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 06:56:52,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] $Ultimate##0-->L726: Formula: (and (= v_~y~0_28 v_~__unbuffered_p0_EAX~0_34) (= v_P0Thread1of2ForFork0_~arg.base_5 |v_P0Thread1of2ForFork0_#in~arg.base_5|) (= v_P0Thread1of2ForFork0_~arg.offset_5 |v_P0Thread1of2ForFork0_#in~arg.offset_5|)) InVars {P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, P0Thread1of2ForFork0_~arg.base=v_P0Thread1of2ForFork0_~arg.base_5, P0Thread1of2ForFork0_~arg.offset=v_P0Thread1of2ForFork0_~arg.offset_5, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of2ForFork0_~arg.base, P0Thread1of2ForFork0_~arg.offset][123], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, 107#P0EXITtrue, P2Thread2of2ForFork2InUse, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, 618#true, 124#L788true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 26#L744true, 626#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), 41#L744true, Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 17#L756true, Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), 635#true, P0Thread1of2ForFork0InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 55#L759true]) [2023-08-04 06:56:52,286 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 06:56:52,286 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 06:56:52,286 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 06:56:52,286 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 06:56:52,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] $Ultimate##0-->L741: Formula: (and (= |v_P1Thread2of2ForFork1_#in~arg.offset_5| v_P1Thread2of2ForFork1_~arg.offset_5) (= v_~x~0_39 1) (= v_P1Thread2of2ForFork1_~arg.base_5 |v_P1Thread2of2ForFork1_#in~arg.base_5|)) InVars {P1Thread2of2ForFork1_#in~arg.offset=|v_P1Thread2of2ForFork1_#in~arg.offset_5|, P1Thread2of2ForFork1_#in~arg.base=|v_P1Thread2of2ForFork1_#in~arg.base_5|} OutVars{P1Thread2of2ForFork1_#in~arg.offset=|v_P1Thread2of2ForFork1_#in~arg.offset_5|, P1Thread2of2ForFork1_~arg.offset=v_P1Thread2of2ForFork1_~arg.offset_5, P1Thread2of2ForFork1_#in~arg.base=|v_P1Thread2of2ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_39, P1Thread2of2ForFork1_~arg.base=v_P1Thread2of2ForFork1_~arg.base_5} AuxVars[] AssignedVars[P1Thread2of2ForFork1_~arg.offset, ~x~0, P1Thread2of2ForFork1_~arg.base][115], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, 114#L741true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 124#L788true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#true, Black: 609#(= ~y~0 0), 41#L744true, Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 607#true, 100#L729true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), 17#L756true, Black: 618#true, 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), 11#P0EXITtrue, 635#true, P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 55#L759true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:52,581 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-08-04 06:56:52,581 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 06:56:52,581 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 06:56:52,581 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 06:56:52,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] $Ultimate##0-->L741: Formula: (and (= v_P1Thread1of2ForFork1_~arg.base_5 |v_P1Thread1of2ForFork1_#in~arg.base_5|) (= |v_P1Thread1of2ForFork1_#in~arg.offset_5| v_P1Thread1of2ForFork1_~arg.offset_5) (= v_~x~0_37 1)) InVars {P1Thread1of2ForFork1_#in~arg.offset=|v_P1Thread1of2ForFork1_#in~arg.offset_5|, P1Thread1of2ForFork1_#in~arg.base=|v_P1Thread1of2ForFork1_#in~arg.base_5|} OutVars{P1Thread1of2ForFork1_#in~arg.offset=|v_P1Thread1of2ForFork1_#in~arg.offset_5|, P1Thread1of2ForFork1_~arg.offset=v_P1Thread1of2ForFork1_~arg.offset_5, P1Thread1of2ForFork1_#in~arg.base=|v_P1Thread1of2ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_37, P1Thread1of2ForFork1_~arg.base=v_P1Thread1of2ForFork1_~arg.base_5} AuxVars[] AssignedVars[P1Thread1of2ForFork1_~arg.offset, ~x~0, P1Thread1of2ForFork1_~arg.base][113], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 56#L741true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 124#L788true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 601#true, 26#L744true, Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 607#true, 100#L729true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), 17#L756true, Black: 618#true, 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 11#P0EXITtrue, Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), 635#true, P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 55#L759true]) [2023-08-04 06:56:52,596 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-08-04 06:56:52,596 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 06:56:52,596 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 06:56:52,596 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-04 06:56:54,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([632] L788-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~x~0_55 2) (= 2 v_~__unbuffered_p2_EAX~0_48) (= v_~__unbuffered_p0_EBX~0_34 0) (= v_~__unbuffered_p0_EAX~0_42 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_49) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_26| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_36|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_26| (mod v_~main$tmp_guard1~0_49 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_36| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~x~0=v_~x~0_55} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_26|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_49, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~x~0=v_~x~0_55} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][166], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 69#L759true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 626#true, Black: 609#(= ~y~0 0), 80#$Ultimate##0true, 41#L744true, Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 100#L729true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 115#P1EXITtrue, 112#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 85#P2EXITtrue, Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), P0Thread1of2ForFork0InUse, 635#true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:54,791 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-04 06:56:54,791 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 06:56:54,791 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 06:56:54,791 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 06:56:54,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] $Ultimate##0-->L726: Formula: (and (= v_~y~0_28 v_~__unbuffered_p0_EAX~0_34) (= v_P0Thread1of2ForFork0_~arg.base_5 |v_P0Thread1of2ForFork0_#in~arg.base_5|) (= v_P0Thread1of2ForFork0_~arg.offset_5 |v_P0Thread1of2ForFork0_#in~arg.offset_5|)) InVars {P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, P0Thread1of2ForFork0_~arg.base=v_P0Thread1of2ForFork0_~arg.base_5, P0Thread1of2ForFork0_~arg.offset=v_P0Thread1of2ForFork0_~arg.offset_5, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of2ForFork0_~arg.base, P0Thread1of2ForFork0_~arg.offset][48], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 94#L726true, 69#L759true, 124#L788true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 626#true, Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 41#L744true, 100#L729true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 115#P1EXITtrue, 85#P2EXITtrue, Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), P0Thread1of2ForFork0InUse, 635#true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:54,791 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-04 06:56:54,791 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 06:56:54,791 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 06:56:54,791 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 06:56:54,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] $Ultimate##0-->L726: Formula: (and (= v_P0Thread2of2ForFork0_~arg.offset_5 |v_P0Thread2of2ForFork0_#in~arg.offset_5|) (= v_P0Thread2of2ForFork0_~arg.base_5 |v_P0Thread2of2ForFork0_#in~arg.base_5|) (= v_~y~0_24 v_~__unbuffered_p0_EAX~0_32)) InVars {P0Thread2of2ForFork0_#in~arg.offset=|v_P0Thread2of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_24, P0Thread2of2ForFork0_#in~arg.base=|v_P0Thread2of2ForFork0_#in~arg.base_5|} OutVars{P0Thread2of2ForFork0_~arg.offset=v_P0Thread2of2ForFork0_~arg.offset_5, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, P0Thread2of2ForFork0_~arg.base=v_P0Thread2of2ForFork0_~arg.base_5, P0Thread2of2ForFork0_#in~arg.offset=|v_P0Thread2of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_24, P0Thread2of2ForFork0_#in~arg.base=|v_P0Thread2of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P0Thread2of2ForFork0_~arg.offset, ~__unbuffered_p0_EAX~0, P0Thread2of2ForFork0_~arg.base][49], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 69#L759true, 124#L788true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 121#L726true, 607#true, 626#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 41#L744true, 62#L729true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 115#P1EXITtrue, 85#P2EXITtrue, Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), P0Thread1of2ForFork0InUse, 635#true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:54,803 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-04 06:56:54,803 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 06:56:54,803 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 06:56:54,803 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 06:56:54,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([632] L788-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~x~0_55 2) (= 2 v_~__unbuffered_p2_EAX~0_48) (= v_~__unbuffered_p0_EBX~0_34 0) (= v_~__unbuffered_p0_EAX~0_42 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_49) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_26| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_36|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_26| (mod v_~main$tmp_guard1~0_49 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_36| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~x~0=v_~x~0_55} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_26|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_49, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~x~0=v_~x~0_55} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][166], [P0Thread2of2ForFork0InUse, 30#$Ultimate##0true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 69#L759true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 626#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), 41#L744true, Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 62#L729true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 115#P1EXITtrue, 112#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 85#P2EXITtrue, Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), 635#true, P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:54,803 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-04 06:56:54,803 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 06:56:54,803 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 06:56:54,804 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 06:56:55,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([632] L788-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~x~0_55 2) (= 2 v_~__unbuffered_p2_EAX~0_48) (= v_~__unbuffered_p0_EBX~0_34 0) (= v_~__unbuffered_p0_EAX~0_42 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_49) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_26| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_36|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_26| (mod v_~main$tmp_guard1~0_49 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_36| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~x~0=v_~x~0_55} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_26|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_49, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~x~0=v_~x~0_55} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][166], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 94#L726true, 69#L759true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 626#true, Black: 609#(= ~y~0 0), 41#L744true, Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 100#L729true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 115#P1EXITtrue, 112#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 85#P2EXITtrue, Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), 635#true, P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:55,155 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-04 06:56:55,155 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 06:56:55,155 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 06:56:55,155 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 06:56:55,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([632] L788-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~x~0_55 2) (= 2 v_~__unbuffered_p2_EAX~0_48) (= v_~__unbuffered_p0_EBX~0_34 0) (= v_~__unbuffered_p0_EAX~0_42 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_49) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_26| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_36|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_26| (mod v_~main$tmp_guard1~0_49 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_36| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~x~0=v_~x~0_55} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_26|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_49, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~x~0=v_~x~0_55} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][166], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 69#L759true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 626#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), 41#L744true, Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 62#L729true, 100#L729true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 115#P1EXITtrue, 112#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 85#P2EXITtrue, Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), P0Thread1of2ForFork0InUse, 635#true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:56:55,382 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-04 06:56:55,382 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 06:56:55,382 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 06:56:55,382 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 06:56:55,571 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([632] L788-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~x~0_55 2) (= 2 v_~__unbuffered_p2_EAX~0_48) (= v_~__unbuffered_p0_EBX~0_34 0) (= v_~__unbuffered_p0_EAX~0_42 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_49) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_26| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_36|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_26| (mod v_~main$tmp_guard1~0_49 256)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_36| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~x~0=v_~x~0_55} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_26|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_49, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~x~0=v_~x~0_55} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][166], [P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 69#L759true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 626#true, Black: 609#(= ~y~0 0), 41#L744true, Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 100#L729true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 115#P1EXITtrue, 112#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 85#P2EXITtrue, Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), 11#P0EXITtrue, 635#true, P0Thread1of2ForFork0InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 06:56:55,571 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is not cut-off event [2023-08-04 06:56:55,571 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-04 06:56:55,571 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-04 06:56:55,572 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-04 06:56:55,600 INFO L124 PetriNetUnfolderBase]: 145210/191568 cut-off events. [2023-08-04 06:56:55,600 INFO L125 PetriNetUnfolderBase]: For 966172/1004598 co-relation queries the response was YES. [2023-08-04 06:56:56,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 792013 conditions, 191568 events. 145210/191568 cut-off events. For 966172/1004598 co-relation queries the response was YES. Maximal size of possible extension queue 9028. Compared 1313804 event pairs, 24961 based on Foata normal form. 13278/193378 useless extension candidates. Maximal degree in co-relation 536885. Up to 162386 conditions per place. [2023-08-04 06:56:57,545 INFO L140 encePairwiseOnDemand]: 202/210 looper letters, 129 selfloop transitions, 7 changer transitions 0/167 dead transitions. [2023-08-04 06:56:57,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 167 transitions, 1775 flow [2023-08-04 06:56:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:56:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:56:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-08-04 06:56:57,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6015873015873016 [2023-08-04 06:56:57,546 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-08-04 06:56:57,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-08-04 06:56:57,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:56:57,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-08-04 06:56:57,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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 06:56:57,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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 06:56:57,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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 06:56:57,549 INFO L175 Difference]: Start difference. First operand has 84 places, 101 transitions, 910 flow. Second operand 3 states and 379 transitions. [2023-08-04 06:56:57,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 167 transitions, 1775 flow [2023-08-04 06:56:59,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 167 transitions, 1749 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 06:56:59,458 INFO L231 Difference]: Finished difference. Result has 85 places, 107 transitions, 941 flow [2023-08-04 06:56:59,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=941, PETRI_PLACES=85, PETRI_TRANSITIONS=107} [2023-08-04 06:56:59,459 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 34 predicate places. [2023-08-04 06:56:59,459 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 107 transitions, 941 flow [2023-08-04 06:56:59,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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 06:56:59,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:56:59,459 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] [2023-08-04 06:56:59,464 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 06:56:59,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-04 06:56:59,660 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:56:59,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:56:59,660 INFO L85 PathProgramCache]: Analyzing trace with hash -552709545, now seen corresponding path program 1 times [2023-08-04 06:56:59,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:56:59,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613893136] [2023-08-04 06:56:59,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:56:59,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:56:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:56:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 06:56:59,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:56:59,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613893136] [2023-08-04 06:56:59,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613893136] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:56:59,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37140370] [2023-08-04 06:56:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:56:59,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:56:59,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:56:59,785 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 06:56:59,788 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 06:56:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:56:59,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-04 06:56:59,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:56:59,928 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 06:56:59,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:57:00,024 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 06:57:00,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37140370] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:57:00,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:57:00,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-08-04 06:57:00,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703068784] [2023-08-04 06:57:00,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:57:00,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 06:57:00,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:57:00,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 06:57:00,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-04 06:57:00,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 210 [2023-08-04 06:57:00,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 107 transitions, 941 flow. Second operand has 8 states, 8 states have (on average 101.5) internal successors, (812), 8 states have internal predecessors, (812), 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 06:57:00,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:57:00,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 210 [2023-08-04 06:57:00,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:57:25,241 INFO L124 PetriNetUnfolderBase]: 233402/303935 cut-off events. [2023-08-04 06:57:25,241 INFO L125 PetriNetUnfolderBase]: For 1478470/1498495 co-relation queries the response was YES. [2023-08-04 06:57:26,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409580 conditions, 303935 events. 233402/303935 cut-off events. For 1478470/1498495 co-relation queries the response was YES. Maximal size of possible extension queue 12205. Compared 2026849 event pairs, 3483 based on Foata normal form. 22959/323505 useless extension candidates. Maximal degree in co-relation 614372. Up to 110351 conditions per place. [2023-08-04 06:57:27,779 INFO L140 encePairwiseOnDemand]: 191/210 looper letters, 463 selfloop transitions, 279 changer transitions 90/841 dead transitions. [2023-08-04 06:57:27,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 841 transitions, 9400 flow [2023-08-04 06:57:27,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-04 06:57:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-04 06:57:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1951 transitions. [2023-08-04 06:57:27,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5464985994397759 [2023-08-04 06:57:27,784 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1951 transitions. [2023-08-04 06:57:27,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1951 transitions. [2023-08-04 06:57:27,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:57:27,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1951 transitions. [2023-08-04 06:57:27,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 114.76470588235294) internal successors, (1951), 17 states have internal predecessors, (1951), 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 06:57:27,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 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 06:57:27,793 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 210.0) internal successors, (3780), 18 states have internal predecessors, (3780), 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 06:57:27,793 INFO L175 Difference]: Start difference. First operand has 85 places, 107 transitions, 941 flow. Second operand 17 states and 1951 transitions. [2023-08-04 06:57:27,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 841 transitions, 9400 flow [2023-08-04 06:57:35,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 841 transitions, 9377 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:57:35,762 INFO L231 Difference]: Finished difference. Result has 116 places, 417 transitions, 5314 flow [2023-08-04 06:57:35,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5314, PETRI_PLACES=116, PETRI_TRANSITIONS=417} [2023-08-04 06:57:35,763 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 65 predicate places. [2023-08-04 06:57:35,763 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 417 transitions, 5314 flow [2023-08-04 06:57:35,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.5) internal successors, (812), 8 states have internal predecessors, (812), 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 06:57:35,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:57:35,763 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, 1, 1, 1, 1] [2023-08-04 06:57:35,771 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 06:57:35,971 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,SelfDestructingSolverStorable16 [2023-08-04 06:57:35,971 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:57:35,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:57:35,972 INFO L85 PathProgramCache]: Analyzing trace with hash -278944052, now seen corresponding path program 1 times [2023-08-04 06:57:35,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:57:35,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204458107] [2023-08-04 06:57:35,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:57:35,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:57:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:57:36,087 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 06:57:36,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:57:36,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204458107] [2023-08-04 06:57:36,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204458107] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:57:36,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275250216] [2023-08-04 06:57:36,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:57:36,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:57:36,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:57:36,089 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 06:57:36,091 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 06:57:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:57:36,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-04 06:57:36,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:57:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 06:57:36,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:57:36,489 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 06:57:36,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275250216] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:57:36,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:57:36,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 17 [2023-08-04 06:57:36,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349517696] [2023-08-04 06:57:36,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:57:36,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-04 06:57:36,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:57:36,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-04 06:57:36,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2023-08-04 06:57:36,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 210 [2023-08-04 06:57:36,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 417 transitions, 5314 flow. Second operand has 18 states, 18 states have (on average 97.77777777777777) internal successors, (1760), 18 states have internal predecessors, (1760), 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 06:57:36,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:57:36,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 210 [2023-08-04 06:57:36,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:58:23,349 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] $Ultimate##0-->L726: Formula: (and (= v_~y~0_28 v_~__unbuffered_p0_EAX~0_34) (= v_P0Thread1of2ForFork0_~arg.base_5 |v_P0Thread1of2ForFork0_#in~arg.base_5|) (= v_P0Thread1of2ForFork0_~arg.offset_5 |v_P0Thread1of2ForFork0_#in~arg.offset_5|)) InVars {P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, P0Thread1of2ForFork0_~arg.base=v_P0Thread1of2ForFork0_~arg.base_5, P0Thread1of2ForFork0_~arg.offset=v_P0Thread1of2ForFork0_~arg.offset_5, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of2ForFork0_~arg.base, P0Thread1of2ForFork0_~arg.offset][950], [P0Thread2of2ForFork0InUse, Black: 835#(<= ~__unbuffered_cnt~0 1), Black: 939#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 740#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P1Thread1of2ForFork1InUse, Black: 947#(and (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 937#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), 20#$Ultimate##0true, P1Thread2of2ForFork1InUse, Black: 943#(and (= ~x~0 0) (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), P2Thread1of2ForFork2InUse, Black: 744#(<= ~__unbuffered_cnt~0 0), Black: 739#(= ~__unbuffered_p2_EAX~0 0), P2Thread2of2ForFork2InUse, 107#P0EXITtrue, Black: 736#true, Black: 953#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= 3 ~__unbuffered_cnt~0))), Black: 949#(and (<= ~__unbuffered_cnt~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 845#(not (= 3 ~__unbuffered_cnt~0)), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 94#L726true, 69#L759true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 643#(<= ~__unbuffered_cnt~0 0), Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), 41#L744true, Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 117#L783-6true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1231#(and (<= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_cnt~0 1)), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 945#(and (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), Black: 951#(and (<= ~__unbuffered_cnt~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 955#(and (= ~x~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 55#L759true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 941#(and (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2023-08-04 06:58:23,350 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-04 06:58:23,350 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 06:58:23,350 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 06:58:23,350 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 06:58:45,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] $Ultimate##0-->L726: Formula: (and (= v_~y~0_28 v_~__unbuffered_p0_EAX~0_34) (= v_P0Thread1of2ForFork0_~arg.base_5 |v_P0Thread1of2ForFork0_#in~arg.base_5|) (= v_P0Thread1of2ForFork0_~arg.offset_5 |v_P0Thread1of2ForFork0_#in~arg.offset_5|)) InVars {P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, P0Thread1of2ForFork0_~arg.base=v_P0Thread1of2ForFork0_~arg.base_5, P0Thread1of2ForFork0_~arg.offset=v_P0Thread1of2ForFork0_~arg.offset_5, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of2ForFork0_~arg.base, P0Thread1of2ForFork0_~arg.offset][950], [Black: 835#(<= ~__unbuffered_cnt~0 1), P0Thread2of2ForFork0InUse, Black: 939#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P1Thread1of2ForFork1InUse, Black: 740#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 114#L741true, Black: 947#(and (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 937#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread2of2ForFork1InUse, Black: 943#(and (= ~x~0 0) (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 744#(<= ~__unbuffered_cnt~0 0), P2Thread1of2ForFork2InUse, Black: 739#(= ~__unbuffered_p2_EAX~0 0), 107#P0EXITtrue, Black: 736#true, P2Thread2of2ForFork2InUse, Black: 953#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= 3 ~__unbuffered_cnt~0))), Black: 949#(and (<= ~__unbuffered_cnt~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 845#(not (= 3 ~__unbuffered_cnt~0)), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, 618#true, 69#L759true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 643#(<= ~__unbuffered_cnt~0 0), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 41#L744true, 117#L783-6true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1231#(and (<= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_cnt~0 1)), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 945#(and (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), Black: 951#(and (<= ~__unbuffered_cnt~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 955#(and (= ~x~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 941#(and (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), 55#L759true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:58:45,393 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-04 06:58:45,393 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 06:58:45,393 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 06:58:45,393 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 06:58:45,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([523] L741-->L744: Formula: (= 2 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0][259], [Black: 835#(<= ~__unbuffered_cnt~0 1), P0Thread2of2ForFork0InUse, Black: 939#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P1Thread1of2ForFork1InUse, Black: 740#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 947#(and (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 937#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread2of2ForFork1InUse, Black: 943#(and (= ~x~0 0) (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 744#(<= ~__unbuffered_cnt~0 0), P2Thread1of2ForFork2InUse, Black: 739#(= ~__unbuffered_p2_EAX~0 0), 107#P0EXITtrue, Black: 736#true, P2Thread2of2ForFork2InUse, Black: 953#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= 3 ~__unbuffered_cnt~0))), Black: 949#(and (<= ~__unbuffered_cnt~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 845#(not (= 3 ~__unbuffered_cnt~0)), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 69#L759true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 449#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 643#(<= ~__unbuffered_cnt~0 0), 607#true, 26#L744true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 80#$Ultimate##0true, 41#L744true, 117#L783-6true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1231#(and (<= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_cnt~0 1)), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 945#(and (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), Black: 951#(and (<= ~__unbuffered_cnt~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 955#(and (= ~x~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 941#(and (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 55#L759true]) [2023-08-04 06:58:45,393 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-04 06:58:45,393 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 06:58:45,393 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 06:58:45,393 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 06:58:45,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] $Ultimate##0-->L726: Formula: (and (= v_~y~0_28 v_~__unbuffered_p0_EAX~0_34) (= v_P0Thread1of2ForFork0_~arg.base_5 |v_P0Thread1of2ForFork0_#in~arg.base_5|) (= v_P0Thread1of2ForFork0_~arg.offset_5 |v_P0Thread1of2ForFork0_#in~arg.offset_5|)) InVars {P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, P0Thread1of2ForFork0_~arg.base=v_P0Thread1of2ForFork0_~arg.base_5, P0Thread1of2ForFork0_~arg.offset=v_P0Thread1of2ForFork0_~arg.offset_5, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of2ForFork0_~arg.base, P0Thread1of2ForFork0_~arg.offset][1248], [P0Thread2of2ForFork0InUse, Black: 835#(<= ~__unbuffered_cnt~0 1), Black: 939#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 740#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P1Thread1of2ForFork1InUse, Black: 937#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), 20#$Ultimate##0true, P1Thread2of2ForFork1InUse, Black: 943#(and (= ~x~0 0) (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), P2Thread1of2ForFork2InUse, Black: 744#(<= ~__unbuffered_cnt~0 0), Black: 739#(= ~__unbuffered_p2_EAX~0 0), P2Thread2of2ForFork2InUse, 107#P0EXITtrue, Black: 736#true, Black: 945#(and (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 953#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= 3 ~__unbuffered_cnt~0))), Black: 949#(and (<= ~__unbuffered_cnt~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 845#(not (= 3 ~__unbuffered_cnt~0)), 947#(and (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 94#L726true, 119#P1EXITtrue, 69#L759true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 643#(<= ~__unbuffered_cnt~0 0), Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 117#L783-6true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 1235#(and (= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EBX~0 1)), Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), Black: 951#(and (<= ~__unbuffered_cnt~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 955#(and (= ~x~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 55#L759true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 941#(and (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2023-08-04 06:58:45,399 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-04 06:58:45,400 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 06:58:45,400 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 06:58:45,400 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 06:59:04,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([523] L741-->L744: Formula: (= 2 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0][259], [Black: 835#(<= ~__unbuffered_cnt~0 1), P0Thread2of2ForFork0InUse, Black: 939#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P1Thread1of2ForFork1InUse, Black: 740#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 947#(and (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 937#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread2of2ForFork1InUse, Black: 943#(and (= ~x~0 0) (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 744#(<= ~__unbuffered_cnt~0 0), P2Thread1of2ForFork2InUse, Black: 739#(= ~__unbuffered_p2_EAX~0 0), 107#P0EXITtrue, Black: 736#true, P2Thread2of2ForFork2InUse, Black: 953#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= 3 ~__unbuffered_cnt~0))), Black: 949#(and (<= ~__unbuffered_cnt~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 845#(not (= 3 ~__unbuffered_cnt~0)), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, 618#true, 69#L759true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 449#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 643#(<= ~__unbuffered_cnt~0 0), 607#true, 26#L744true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 41#L744true, 117#L783-6true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1231#(and (<= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_cnt~0 1)), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 945#(and (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), Black: 951#(and (<= ~__unbuffered_cnt~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 955#(and (= ~x~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 941#(and (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 55#L759true]) [2023-08-04 06:59:04,338 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 06:59:04,338 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:59:04,338 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:59:04,338 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:59:04,339 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] $Ultimate##0-->L726: Formula: (and (= v_~y~0_28 v_~__unbuffered_p0_EAX~0_34) (= v_P0Thread1of2ForFork0_~arg.base_5 |v_P0Thread1of2ForFork0_#in~arg.base_5|) (= v_P0Thread1of2ForFork0_~arg.offset_5 |v_P0Thread1of2ForFork0_#in~arg.offset_5|)) InVars {P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, P0Thread1of2ForFork0_~arg.base=v_P0Thread1of2ForFork0_~arg.base_5, P0Thread1of2ForFork0_~arg.offset=v_P0Thread1of2ForFork0_~arg.offset_5, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of2ForFork0_~arg.base, P0Thread1of2ForFork0_~arg.offset][1248], [Black: 835#(<= ~__unbuffered_cnt~0 1), P0Thread2of2ForFork0InUse, Black: 939#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P1Thread1of2ForFork1InUse, Black: 740#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 114#L741true, Black: 937#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread2of2ForFork1InUse, Black: 943#(and (= ~x~0 0) (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 744#(<= ~__unbuffered_cnt~0 0), P2Thread1of2ForFork2InUse, Black: 739#(= ~__unbuffered_p2_EAX~0 0), 107#P0EXITtrue, Black: 736#true, P2Thread2of2ForFork2InUse, Black: 945#(and (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 953#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= 3 ~__unbuffered_cnt~0))), Black: 949#(and (<= ~__unbuffered_cnt~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 845#(not (= 3 ~__unbuffered_cnt~0)), 947#(and (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 119#P1EXITtrue, 94#L726true, 618#true, 69#L759true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 643#(<= ~__unbuffered_cnt~0 0), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 117#L783-6true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 1235#(and (= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EBX~0 1)), Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), Black: 951#(and (<= ~__unbuffered_cnt~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 955#(and (= ~x~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 941#(and (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), 55#L759true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:59:04,339 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 06:59:04,340 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:59:04,340 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:59:04,340 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:59:04,340 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([523] L741-->L744: Formula: (= 2 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0][301], [Black: 835#(<= ~__unbuffered_cnt~0 1), P0Thread2of2ForFork0InUse, Black: 939#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P1Thread1of2ForFork1InUse, Black: 740#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 937#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread2of2ForFork1InUse, Black: 943#(and (= ~x~0 0) (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 744#(<= ~__unbuffered_cnt~0 0), P2Thread1of2ForFork2InUse, Black: 739#(= ~__unbuffered_p2_EAX~0 0), 107#P0EXITtrue, Black: 736#true, P2Thread2of2ForFork2InUse, Black: 945#(and (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 953#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= 3 ~__unbuffered_cnt~0))), Black: 949#(and (<= ~__unbuffered_cnt~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 845#(not (= 3 ~__unbuffered_cnt~0)), 947#(and (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 119#P1EXITtrue, 618#true, 69#L759true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 449#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 643#(<= ~__unbuffered_cnt~0 0), 607#true, 26#L744true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 80#$Ultimate##0true, 117#L783-6true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 1235#(and (= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EBX~0 1)), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), Black: 951#(and (<= ~__unbuffered_cnt~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 955#(and (= ~x~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 941#(and (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 55#L759true]) [2023-08-04 06:59:04,340 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 06:59:04,340 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:59:04,340 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:59:04,340 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:59:04,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] $Ultimate##0-->L726: Formula: (and (= v_~y~0_28 v_~__unbuffered_p0_EAX~0_34) (= v_P0Thread1of2ForFork0_~arg.base_5 |v_P0Thread1of2ForFork0_#in~arg.base_5|) (= v_P0Thread1of2ForFork0_~arg.offset_5 |v_P0Thread1of2ForFork0_#in~arg.offset_5|)) InVars {P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, P0Thread1of2ForFork0_~arg.base=v_P0Thread1of2ForFork0_~arg.base_5, P0Thread1of2ForFork0_~arg.offset=v_P0Thread1of2ForFork0_~arg.offset_5, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of2ForFork0_~arg.base, P0Thread1of2ForFork0_~arg.offset][950], [Black: 835#(<= ~__unbuffered_cnt~0 1), P0Thread2of2ForFork0InUse, Black: 939#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 740#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P1Thread1of2ForFork1InUse, Black: 947#(and (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 937#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), 20#$Ultimate##0true, P1Thread2of2ForFork1InUse, Black: 943#(and (= ~x~0 0) (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 744#(<= ~__unbuffered_cnt~0 0), P2Thread1of2ForFork2InUse, 88#L783-11true, Black: 739#(= ~__unbuffered_p2_EAX~0 0), Black: 736#true, P2Thread2of2ForFork2InUse, 107#P0EXITtrue, Black: 953#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= 3 ~__unbuffered_cnt~0))), Black: 949#(and (<= ~__unbuffered_cnt~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 845#(not (= 3 ~__unbuffered_cnt~0)), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 94#L726true, 69#L759true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 643#(<= ~__unbuffered_cnt~0 0), Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 41#L744true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), 1231#(and (<= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_cnt~0 1)), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 945#(and (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), Black: 951#(and (<= ~__unbuffered_cnt~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 955#(and (= ~x~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 55#L759true, Black: 941#(and (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:59:04,352 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 06:59:04,352 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:59:04,352 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:59:04,352 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 06:59:30,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([523] L741-->L744: Formula: (= 2 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0][259], [Black: 835#(<= ~__unbuffered_cnt~0 1), P0Thread2of2ForFork0InUse, Black: 939#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 740#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P1Thread1of2ForFork1InUse, Black: 947#(and (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 937#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread2of2ForFork1InUse, Black: 943#(and (= ~x~0 0) (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 744#(<= ~__unbuffered_cnt~0 0), P2Thread1of2ForFork2InUse, Black: 739#(= ~__unbuffered_p2_EAX~0 0), 107#P0EXITtrue, Black: 736#true, P2Thread2of2ForFork2InUse, Black: 953#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= 3 ~__unbuffered_cnt~0))), Black: 949#(and (<= ~__unbuffered_cnt~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 845#(not (= 3 ~__unbuffered_cnt~0)), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 69#L759true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 449#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 643#(<= ~__unbuffered_cnt~0 0), 607#true, 26#L744true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), 41#L744true, Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 62#L729true, 117#L783-6true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), 1231#(and (<= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_cnt~0 1)), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 945#(and (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), Black: 951#(and (<= ~__unbuffered_cnt~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 955#(and (= ~x~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 941#(and (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 55#L759true]) [2023-08-04 06:59:30,430 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,431 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,431 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,431 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([523] L741-->L744: Formula: (= 2 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0][301], [Black: 835#(<= ~__unbuffered_cnt~0 1), P0Thread2of2ForFork0InUse, Black: 939#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P1Thread1of2ForFork1InUse, Black: 740#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 937#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread2of2ForFork1InUse, Black: 943#(and (= ~x~0 0) (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 744#(<= ~__unbuffered_cnt~0 0), P2Thread1of2ForFork2InUse, Black: 739#(= ~__unbuffered_p2_EAX~0 0), 107#P0EXITtrue, Black: 736#true, P2Thread2of2ForFork2InUse, Black: 945#(and (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 953#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= 3 ~__unbuffered_cnt~0))), Black: 949#(and (<= ~__unbuffered_cnt~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 845#(not (= 3 ~__unbuffered_cnt~0)), 947#(and (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, 119#P1EXITtrue, 618#true, 69#L759true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 449#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 643#(<= ~__unbuffered_cnt~0 0), 607#true, 26#L744true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 117#L783-6true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 1235#(and (= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EBX~0 1)), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), Black: 951#(and (<= ~__unbuffered_cnt~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 955#(and (= ~x~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 941#(and (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 55#L759true]) [2023-08-04 06:59:30,433 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,433 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,433 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,433 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] $Ultimate##0-->L726: Formula: (and (= v_~y~0_28 v_~__unbuffered_p0_EAX~0_34) (= v_P0Thread1of2ForFork0_~arg.base_5 |v_P0Thread1of2ForFork0_#in~arg.base_5|) (= v_P0Thread1of2ForFork0_~arg.offset_5 |v_P0Thread1of2ForFork0_#in~arg.offset_5|)) InVars {P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, P0Thread1of2ForFork0_~arg.base=v_P0Thread1of2ForFork0_~arg.base_5, P0Thread1of2ForFork0_~arg.offset=v_P0Thread1of2ForFork0_~arg.offset_5, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of2ForFork0_~arg.base, P0Thread1of2ForFork0_~arg.offset][950], [Black: 835#(<= ~__unbuffered_cnt~0 1), P0Thread2of2ForFork0InUse, Black: 939#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 740#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P1Thread1of2ForFork1InUse, 114#L741true, Black: 947#(and (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 937#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread2of2ForFork1InUse, Black: 943#(and (= ~x~0 0) (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 744#(<= ~__unbuffered_cnt~0 0), P2Thread1of2ForFork2InUse, 88#L783-11true, Black: 739#(= ~__unbuffered_p2_EAX~0 0), Black: 736#true, 107#P0EXITtrue, P2Thread2of2ForFork2InUse, Black: 953#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= 3 ~__unbuffered_cnt~0))), Black: 949#(and (<= ~__unbuffered_cnt~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 845#(not (= 3 ~__unbuffered_cnt~0)), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L726true, 618#true, 69#L759true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 643#(<= ~__unbuffered_cnt~0 0), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 41#L744true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1231#(and (<= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_cnt~0 1)), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 945#(and (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), Black: 951#(and (<= ~__unbuffered_cnt~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 955#(and (= ~x~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 55#L759true, Black: 941#(and (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:59:30,437 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,438 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,452 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,453 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,453 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([523] L741-->L744: Formula: (= 2 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0][259], [Black: 835#(<= ~__unbuffered_cnt~0 1), P0Thread2of2ForFork0InUse, Black: 939#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 740#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P1Thread1of2ForFork1InUse, Black: 947#(and (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), P1Thread2of2ForFork1InUse, Black: 937#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 943#(and (= ~x~0 0) (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 744#(<= ~__unbuffered_cnt~0 0), P2Thread1of2ForFork2InUse, 88#L783-11true, Black: 739#(= ~__unbuffered_p2_EAX~0 0), Black: 736#true, 107#P0EXITtrue, P2Thread2of2ForFork2InUse, Black: 953#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= 3 ~__unbuffered_cnt~0))), Black: 949#(and (<= ~__unbuffered_cnt~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 845#(not (= 3 ~__unbuffered_cnt~0)), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 618#true, 69#L759true, 629#(= ~__unbuffered_p0_EAX~0 0), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, Black: 643#(<= ~__unbuffered_cnt~0 0), 26#L744true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), 41#L744true, Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 80#$Ultimate##0true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1231#(and (<= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EBX~0 1) (= ~__unbuffered_cnt~0 1)), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 945#(and (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), Black: 951#(and (<= ~__unbuffered_cnt~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 955#(and (= ~x~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 55#L759true, Black: 941#(and (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0))]) [2023-08-04 06:59:30,453 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,453 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,453 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,453 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] $Ultimate##0-->L726: Formula: (and (= v_~y~0_28 v_~__unbuffered_p0_EAX~0_34) (= v_P0Thread1of2ForFork0_~arg.base_5 |v_P0Thread1of2ForFork0_#in~arg.base_5|) (= v_P0Thread1of2ForFork0_~arg.offset_5 |v_P0Thread1of2ForFork0_#in~arg.offset_5|)) InVars {P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, P0Thread1of2ForFork0_#in~arg.offset=|v_P0Thread1of2ForFork0_#in~arg.offset_5|, P0Thread1of2ForFork0_~arg.base=v_P0Thread1of2ForFork0_~arg.base_5, P0Thread1of2ForFork0_~arg.offset=v_P0Thread1of2ForFork0_~arg.offset_5, ~y~0=v_~y~0_28, P0Thread1of2ForFork0_#in~arg.base=|v_P0Thread1of2ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of2ForFork0_~arg.base, P0Thread1of2ForFork0_~arg.offset][1248], [Black: 835#(<= ~__unbuffered_cnt~0 1), P0Thread2of2ForFork0InUse, Black: 939#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 740#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P1Thread1of2ForFork1InUse, Black: 937#(and (= ~x~0 0) (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), 20#$Ultimate##0true, P1Thread2of2ForFork1InUse, Black: 943#(and (= ~x~0 0) (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 744#(<= ~__unbuffered_cnt~0 0), P2Thread1of2ForFork2InUse, 88#L783-11true, Black: 739#(= ~__unbuffered_p2_EAX~0 0), Black: 736#true, P2Thread2of2ForFork2InUse, 107#P0EXITtrue, Black: 945#(and (<= ~__unbuffered_cnt~0 1) (= ~__unbuffered_p2_EAX~0 0)), Black: 953#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= 3 ~__unbuffered_cnt~0))), Black: 949#(and (<= ~__unbuffered_cnt~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 845#(not (= 3 ~__unbuffered_cnt~0)), 947#(and (not (= 3 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 119#P1EXITtrue, 618#true, 94#L726true, 69#L759true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 643#(<= ~__unbuffered_cnt~0 0), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~y~0 0), Black: 612#(and (= ~y~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 620#(= ~__unbuffered_p0_EAX~0 0), Black: 621#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 1235#(and (= 2 ~__unbuffered_cnt~0) (<= ~__unbuffered_p2_EAX~0 1) (= ~__unbuffered_p0_EBX~0 1)), Black: 629#(= ~__unbuffered_p0_EAX~0 0), Black: 631#(and (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0)), Black: 951#(and (<= ~__unbuffered_cnt~0 1) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~x~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 955#(and (= ~x~0 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of2ForFork0InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 55#L759true, Black: 941#(and (<= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 06:59:30,501 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,501 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,501 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 06:59:30,501 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event