/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe025_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 00:58:23,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 00:58:23,175 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 00:58:23,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 00:58:23,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 00:58:23,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 00:58:23,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 00:58:23,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 00:58:23,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 00:58:23,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 00:58:23,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 00:58:23,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 00:58:23,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 00:58:23,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 00:58:23,205 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 00:58:23,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 00:58:23,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 00:58:23,206 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 00:58:23,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 00:58:23,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 00:58:23,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 00:58:23,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 00:58:23,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 00:58:23,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 00:58:23,208 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 00:58:23,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 00:58:23,208 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 00:58:23,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 00:58:23,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 00:58:23,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 00:58:23,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 00:58:23,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 00:58:23,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 00:58:23,210 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 00:58:23,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 00:58:23,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 00:58:23,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 00:58:23,210 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 00:58:23,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 00:58:23,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 00:58:23,210 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 00:58:23,210 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-04 00:58:23,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 00:58:23,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 00:58:23,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 00:58:23,410 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 00:58:23,411 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 00:58:23,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe025_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i [2023-08-04 00:58:24,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 00:58:24,542 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 00:58:24,542 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe025_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i [2023-08-04 00:58:24,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9bddcf0/88281e8347c94b38bb80ab9c8b45f0a9/FLAG9ed1d859e [2023-08-04 00:58:24,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9bddcf0/88281e8347c94b38bb80ab9c8b45f0a9 [2023-08-04 00:58:24,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 00:58:24,580 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 00:58:24,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 00:58:24,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 00:58:24,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 00:58:24,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 12:58:24" (1/1) ... [2023-08-04 00:58:24,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fbbc235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:58:24, skipping insertion in model container [2023-08-04 00:58:24,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 12:58:24" (1/1) ... [2023-08-04 00:58:24,617 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 00:58:24,719 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_safe025_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i[975,988] [2023-08-04 00:58:24,845 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 00:58:24,853 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 00:58:24,861 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_safe025_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i[975,988] [2023-08-04 00:58:24,869 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 00:58:24,870 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 00:58:24,882 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 00:58:24,903 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 00:58:24,903 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 00:58:24,907 INFO L206 MainTranslator]: Completed translation [2023-08-04 00:58:24,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:58:24 WrapperNode [2023-08-04 00:58:24,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 00:58:24,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 00:58:24,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 00:58:24,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 00:58:24,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:58:24" (1/1) ... [2023-08-04 00:58:24,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:58:24" (1/1) ... [2023-08-04 00:58:24,940 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2023-08-04 00:58:24,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 00:58:24,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 00:58:24,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 00:58:24,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 00:58:24,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:58:24" (1/1) ... [2023-08-04 00:58:24,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:58:24" (1/1) ... [2023-08-04 00:58:24,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:58:24" (1/1) ... [2023-08-04 00:58:24,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:58:24" (1/1) ... [2023-08-04 00:58:24,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:58:24" (1/1) ... [2023-08-04 00:58:24,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:58:24" (1/1) ... [2023-08-04 00:58:24,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:58:24" (1/1) ... [2023-08-04 00:58:24,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:58:24" (1/1) ... [2023-08-04 00:58:24,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 00:58:24,958 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 00:58:24,959 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 00:58:24,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 00:58:24,959 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:58:24" (1/1) ... [2023-08-04 00:58:24,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 00:58:24,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:58:24,987 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 00:58:24,995 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 00:58:25,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 00:58:25,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 00:58:25,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 00:58:25,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 00:58:25,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 00:58:25,012 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 00:58:25,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 00:58:25,012 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 00:58:25,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 00:58:25,012 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 00:58:25,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 00:58:25,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 00:58:25,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 00:58:25,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 00:58:25,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 00:58:25,014 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 00:58:25,118 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 00:58:25,120 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 00:58:25,281 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 00:58:25,286 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 00:58:25,286 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 00:58:25,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 12:58:25 BoogieIcfgContainer [2023-08-04 00:58:25,287 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 00:58:25,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 00:58:25,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 00:58:25,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 00:58:25,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 12:58:24" (1/3) ... [2023-08-04 00:58:25,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640eebea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 12:58:25, skipping insertion in model container [2023-08-04 00:58:25,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:58:24" (2/3) ... [2023-08-04 00:58:25,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640eebea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 12:58:25, skipping insertion in model container [2023-08-04 00:58:25,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 12:58:25" (3/3) ... [2023-08-04 00:58:25,295 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe025_pso.oepc_pso.opt_tso.oepc_tso.opt_bound2.i [2023-08-04 00:58:25,300 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 00:58:25,307 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 00:58:25,307 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 00:58:25,307 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 00:58:25,358 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 00:58:25,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 106 transitions, 227 flow [2023-08-04 00:58:25,524 INFO L124 PetriNetUnfolderBase]: 30/414 cut-off events. [2023-08-04 00:58:25,524 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:58:25,534 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 1853 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 00:58:25,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 106 transitions, 227 flow [2023-08-04 00:58:25,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 171 flow [2023-08-04 00:58:25,540 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:58:25,550 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 171 flow [2023-08-04 00:58:25,553 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 171 flow [2023-08-04 00:58:25,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 171 flow [2023-08-04 00:58:25,581 INFO L124 PetriNetUnfolderBase]: 6/190 cut-off events. [2023-08-04 00:58:25,582 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:58:25,582 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 587 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 00:58:25,584 INFO L119 LiptonReduction]: Number of co-enabled transitions 1116 [2023-08-04 00:58:26,945 INFO L134 LiptonReduction]: Checked pairs total: 2132 [2023-08-04 00:58:26,946 INFO L136 LiptonReduction]: Total number of compositions: 60 [2023-08-04 00:58:26,955 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 00:58:26,959 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;@2ce8d0f0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:58:26,959 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 00:58:26,962 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:58:26,962 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-08-04 00:58:26,962 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:58:26,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:58:26,963 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 00:58:26,963 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:58:26,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:58:26,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1984253370, now seen corresponding path program 1 times [2023-08-04 00:58:26,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:58:26,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332076914] [2023-08-04 00:58:26,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:26,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:58:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:58:27,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 00:58:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:58:27,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 00:58:27,066 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 00:58:27,067 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 00:58:27,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 00:58:27,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 00:58:27,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 00:58:27,069 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 00:58:27,070 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (1/2) [2023-08-04 00:58:27,071 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 00:58:27,071 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 00:58:27,087 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 00:58:27,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 290 flow [2023-08-04 00:58:27,188 INFO L124 PetriNetUnfolderBase]: 93/1304 cut-off events. [2023-08-04 00:58:27,188 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 00:58:27,194 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 35. Compared 8886 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 00:58:27,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 290 flow [2023-08-04 00:58:27,196 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 99 transitions, 234 flow [2023-08-04 00:58:27,196 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:58:27,196 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 99 transitions, 234 flow [2023-08-04 00:58:27,196 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 99 transitions, 234 flow [2023-08-04 00:58:27,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 99 transitions, 234 flow [2023-08-04 00:58:27,230 INFO L124 PetriNetUnfolderBase]: 12/548 cut-off events. [2023-08-04 00:58:27,230 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 00:58:27,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 548 events. 12/548 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2784 event pairs, 0 based on Foata normal form. 0/524 useless extension candidates. Maximal degree in co-relation 441. Up to 27 conditions per place. [2023-08-04 00:58:27,237 INFO L119 LiptonReduction]: Number of co-enabled transitions 2988 [2023-08-04 00:58:28,494 INFO L134 LiptonReduction]: Checked pairs total: 6582 [2023-08-04 00:58:28,494 INFO L136 LiptonReduction]: Total number of compositions: 66 [2023-08-04 00:58:28,496 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 00:58:28,496 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;@2ce8d0f0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:58:28,496 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 00:58:28,501 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:58:28,501 INFO L124 PetriNetUnfolderBase]: 0/62 cut-off events. [2023-08-04 00:58:28,501 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 00:58:28,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:58:28,502 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-04 00:58:28,502 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:58:28,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:58:28,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1323892661, now seen corresponding path program 1 times [2023-08-04 00:58:28,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:58:28,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564321879] [2023-08-04 00:58:28,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:28,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:58:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 00:58:28,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:58:28,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564321879] [2023-08-04 00:58:28,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564321879] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:58:28,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:58:28,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:58:28,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592947332] [2023-08-04 00:58:28,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:58:28,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:58:28,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:58:28,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:58:28,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:58:28,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 193 [2023-08-04 00:58:28,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 00:58:28,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:58:28,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 193 [2023-08-04 00:58:28,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:58:30,032 INFO L124 PetriNetUnfolderBase]: 12844/19670 cut-off events. [2023-08-04 00:58:30,033 INFO L125 PetriNetUnfolderBase]: For 1812/1812 co-relation queries the response was YES. [2023-08-04 00:58:30,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39357 conditions, 19670 events. 12844/19670 cut-off events. For 1812/1812 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 138161 event pairs, 9918 based on Foata normal form. 0/19438 useless extension candidates. Maximal degree in co-relation 11953. Up to 17234 conditions per place. [2023-08-04 00:58:30,127 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 28 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-04 00:58:30,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 180 flow [2023-08-04 00:58:30,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:58:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:58:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-08-04 00:58:30,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6286701208981001 [2023-08-04 00:58:30,143 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-08-04 00:58:30,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-08-04 00:58:30,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:58:30,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-08-04 00:58:30,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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 00:58:30,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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 00:58:30,154 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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 00:58:30,155 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 112 flow. Second operand 3 states and 364 transitions. [2023-08-04 00:58:30,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 180 flow [2023-08-04 00:58:30,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 42 transitions, 174 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-04 00:58:30,164 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 118 flow [2023-08-04 00:58:30,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=106, 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=118, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-04 00:58:30,168 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-04 00:58:30,169 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 118 flow [2023-08-04 00:58:30,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 00:58:30,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:58:30,175 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 00:58:30,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 00:58:30,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:58:30,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:58:30,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1383190586, now seen corresponding path program 1 times [2023-08-04 00:58:30,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:58:30,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376565948] [2023-08-04 00:58:30,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:30,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:58:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:30,283 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:58:30,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:58:30,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376565948] [2023-08-04 00:58:30,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376565948] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:58:30,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006111566] [2023-08-04 00:58:30,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:30,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:58:30,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:58:30,291 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 00:58:30,294 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 00:58:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:30,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 00:58:30,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:58:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:58:30,394 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:58:30,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006111566] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:58:30,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:58:30,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 00:58:30,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714491915] [2023-08-04 00:58:30,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:58:30,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:58:30,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:58:30,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:58:30,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 00:58:30,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 193 [2023-08-04 00:58:30,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:58:30,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:58:30,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 193 [2023-08-04 00:58:30,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:58:31,529 INFO L124 PetriNetUnfolderBase]: 12832/19625 cut-off events. [2023-08-04 00:58:31,530 INFO L125 PetriNetUnfolderBase]: For 1479/1479 co-relation queries the response was YES. [2023-08-04 00:58:31,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39027 conditions, 19625 events. 12832/19625 cut-off events. For 1479/1479 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 137206 event pairs, 7728 based on Foata normal form. 9/19453 useless extension candidates. Maximal degree in co-relation 13971. Up to 17187 conditions per place. [2023-08-04 00:58:31,612 INFO L140 encePairwiseOnDemand]: 189/193 looper letters, 31 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-08-04 00:58:31,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 202 flow [2023-08-04 00:58:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 00:58:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 00:58:31,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2023-08-04 00:58:31,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6072538860103627 [2023-08-04 00:58:31,614 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 586 transitions. [2023-08-04 00:58:31,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 586 transitions. [2023-08-04 00:58:31,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:58:31,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 586 transitions. [2023-08-04 00:58:31,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 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 00:58:31,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 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 00:58:31,618 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 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 00:58:31,618 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 118 flow. Second operand 5 states and 586 transitions. [2023-08-04 00:58:31,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 202 flow [2023-08-04 00:58:31,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 199 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 00:58:31,620 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 132 flow [2023-08-04 00:58:31,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2023-08-04 00:58:31,620 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2023-08-04 00:58:31,620 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 132 flow [2023-08-04 00:58:31,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:58:31,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:58:31,621 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:58:31,628 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 00:58:31,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:58:31,826 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:58:31,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:58:31,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1365437324, now seen corresponding path program 1 times [2023-08-04 00:58:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:58:31,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32945889] [2023-08-04 00:58:31,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:31,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:58:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:31,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 00:58:31,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:58:31,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32945889] [2023-08-04 00:58:31,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32945889] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:58:31,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592191726] [2023-08-04 00:58:31,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:31,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:58:31,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:58:31,898 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 00:58:31,900 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 00:58:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:31,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 00:58:31,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:58:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 00:58:31,973 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:58:31,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592191726] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:58:31,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:58:31,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 00:58:31,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64550650] [2023-08-04 00:58:31,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:58:31,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:58:31,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:58:31,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:58:31,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:58:31,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 193 [2023-08-04 00:58:31,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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 00:58:31,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:58:31,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 193 [2023-08-04 00:58:31,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:58:33,128 INFO L124 PetriNetUnfolderBase]: 12242/18740 cut-off events. [2023-08-04 00:58:33,128 INFO L125 PetriNetUnfolderBase]: For 1366/1366 co-relation queries the response was YES. [2023-08-04 00:58:33,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37339 conditions, 18740 events. 12242/18740 cut-off events. For 1366/1366 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 130963 event pairs, 9508 based on Foata normal form. 0/18523 useless extension candidates. Maximal degree in co-relation 11408. Up to 16198 conditions per place. [2023-08-04 00:58:33,193 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 33 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2023-08-04 00:58:33,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 47 transitions, 220 flow [2023-08-04 00:58:33,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:58:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:58:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-04 00:58:33,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6355785837651122 [2023-08-04 00:58:33,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-04 00:58:33,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-04 00:58:33,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:58:33,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-04 00:58:33,196 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 00:58:33,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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 00:58:33,197 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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 00:58:33,197 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 132 flow. Second operand 3 states and 368 transitions. [2023-08-04 00:58:33,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 47 transitions, 220 flow [2023-08-04 00:58:33,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 47 transitions, 213 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-04 00:58:33,199 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 140 flow [2023-08-04 00:58:33,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2023-08-04 00:58:33,199 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-04 00:58:33,200 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 140 flow [2023-08-04 00:58:33,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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 00:58:33,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:58:33,200 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:58:33,206 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 00:58:33,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-04 00:58:33,407 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:58:33,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:58:33,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2147287057, now seen corresponding path program 1 times [2023-08-04 00:58:33,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:58:33,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980450659] [2023-08-04 00:58:33,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:33,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:58:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 00:58:33,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:58:33,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980450659] [2023-08-04 00:58:33,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980450659] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:58:33,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759631492] [2023-08-04 00:58:33,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:33,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:58:33,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:58:33,460 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 00:58:33,462 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 00:58:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:33,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:58:33,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:58:33,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 00:58:33,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:58:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 00:58:33,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759631492] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:58:33,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:58:33,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 00:58:33,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829195988] [2023-08-04 00:58:33,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:58:33,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:58:33,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:58:33,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:58:33,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:58:33,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 193 [2023-08-04 00:58:33,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 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 00:58:33,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:58:33,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 193 [2023-08-04 00:58:33,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:58:34,267 INFO L124 PetriNetUnfolderBase]: 9694/14591 cut-off events. [2023-08-04 00:58:34,267 INFO L125 PetriNetUnfolderBase]: For 1233/1233 co-relation queries the response was YES. [2023-08-04 00:58:34,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29316 conditions, 14591 events. 9694/14591 cut-off events. For 1233/1233 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 95558 event pairs, 5616 based on Foata normal form. 3/14512 useless extension candidates. Maximal degree in co-relation 10429. Up to 12736 conditions per place. [2023-08-04 00:58:34,326 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 32 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-08-04 00:58:34,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 46 transitions, 217 flow [2023-08-04 00:58:34,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:58:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:58:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-08-04 00:58:34,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6152849740932642 [2023-08-04 00:58:34,328 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-08-04 00:58:34,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-08-04 00:58:34,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:58:34,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-08-04 00:58:34,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:58:34,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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 00:58:34,331 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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 00:58:34,331 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 140 flow. Second operand 4 states and 475 transitions. [2023-08-04 00:58:34,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 46 transitions, 217 flow [2023-08-04 00:58:34,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 46 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:58:34,332 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 135 flow [2023-08-04 00:58:34,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2023-08-04 00:58:34,333 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-08-04 00:58:34,333 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 135 flow [2023-08-04 00:58:34,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 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 00:58:34,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:58:34,334 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:58:34,338 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 00:58:34,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:58:34,538 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:58:34,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:58:34,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1628040401, now seen corresponding path program 1 times [2023-08-04 00:58:34,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:58:34,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058002523] [2023-08-04 00:58:34,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:34,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:58:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 00:58:34,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:58:34,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058002523] [2023-08-04 00:58:34,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058002523] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:58:34,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076159099] [2023-08-04 00:58:34,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:34,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:58:34,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:58:34,606 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 00:58:34,607 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 00:58:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:34,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 00:58:34,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:58:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 00:58:34,683 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:58:34,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076159099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:58:34,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:58:34,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 00:58:34,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259863875] [2023-08-04 00:58:34,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:58:34,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:58:34,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:58:34,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:58:34,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 00:58:34,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 193 [2023-08-04 00:58:34,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 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 00:58:34,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:58:34,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 193 [2023-08-04 00:58:34,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:58:35,341 INFO L124 PetriNetUnfolderBase]: 9478/14173 cut-off events. [2023-08-04 00:58:35,341 INFO L125 PetriNetUnfolderBase]: For 1006/1006 co-relation queries the response was YES. [2023-08-04 00:58:35,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28560 conditions, 14173 events. 9478/14173 cut-off events. For 1006/1006 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 92069 event pairs, 2182 based on Foata normal form. 81/14253 useless extension candidates. Maximal degree in co-relation 10157. Up to 11907 conditions per place. [2023-08-04 00:58:35,415 INFO L140 encePairwiseOnDemand]: 189/193 looper letters, 44 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2023-08-04 00:58:35,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 269 flow [2023-08-04 00:58:35,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 00:58:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 00:58:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2023-08-04 00:58:35,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6196891191709845 [2023-08-04 00:58:35,417 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 598 transitions. [2023-08-04 00:58:35,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 598 transitions. [2023-08-04 00:58:35,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:58:35,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 598 transitions. [2023-08-04 00:58:35,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 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 00:58:35,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 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 00:58:35,421 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 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 00:58:35,421 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 135 flow. Second operand 5 states and 598 transitions. [2023-08-04 00:58:35,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 269 flow [2023-08-04 00:58:35,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 262 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 00:58:35,423 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 145 flow [2023-08-04 00:58:35,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2023-08-04 00:58:35,424 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-08-04 00:58:35,424 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 145 flow [2023-08-04 00:58:35,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 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 00:58:35,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:58:35,424 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:58:35,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-04 00:58:35,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:58:35,629 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:58:35,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:58:35,630 INFO L85 PathProgramCache]: Analyzing trace with hash 972809577, now seen corresponding path program 1 times [2023-08-04 00:58:35,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:58:35,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986603687] [2023-08-04 00:58:35,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:35,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:58:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 00:58:35,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:58:35,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986603687] [2023-08-04 00:58:35,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986603687] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:58:35,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782472470] [2023-08-04 00:58:35,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:35,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:58:35,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:58:35,699 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 00:58:35,700 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 00:58:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:35,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:58:35,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:58:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 00:58:35,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:58:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 00:58:35,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782472470] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:58:35,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:58:35,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 00:58:35,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009242987] [2023-08-04 00:58:35,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:58:35,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:58:35,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:58:35,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:58:35,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:58:35,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 193 [2023-08-04 00:58:35,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 39 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 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 00:58:35,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:58:35,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 193 [2023-08-04 00:58:35,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:58:36,477 INFO L124 PetriNetUnfolderBase]: 7588/11203 cut-off events. [2023-08-04 00:58:36,477 INFO L125 PetriNetUnfolderBase]: For 1324/1324 co-relation queries the response was YES. [2023-08-04 00:58:36,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22923 conditions, 11203 events. 7588/11203 cut-off events. For 1324/1324 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 69021 event pairs, 4450 based on Foata normal form. 27/11229 useless extension candidates. Maximal degree in co-relation 8129. Up to 9394 conditions per place. [2023-08-04 00:58:36,535 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 40 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2023-08-04 00:58:36,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 53 transitions, 255 flow [2023-08-04 00:58:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:58:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:58:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-08-04 00:58:36,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6256476683937824 [2023-08-04 00:58:36,537 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-08-04 00:58:36,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-08-04 00:58:36,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:58:36,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-08-04 00:58:36,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 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 00:58:36,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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 00:58:36,539 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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 00:58:36,539 INFO L175 Difference]: Start difference. First operand has 61 places, 39 transitions, 145 flow. Second operand 4 states and 483 transitions. [2023-08-04 00:58:36,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 53 transitions, 255 flow [2023-08-04 00:58:36,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 53 transitions, 250 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 00:58:36,542 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 138 flow [2023-08-04 00:58:36,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=62, PETRI_TRANSITIONS=38} [2023-08-04 00:58:36,542 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-04 00:58:36,542 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 138 flow [2023-08-04 00:58:36,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 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 00:58:36,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:58:36,543 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:58:36,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-04 00:58:36,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:58:36,748 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:58:36,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:58:36,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1227676927, now seen corresponding path program 1 times [2023-08-04 00:58:36,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:58:36,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579361688] [2023-08-04 00:58:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:36,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:58:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 00:58:36,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:58:36,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579361688] [2023-08-04 00:58:36,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579361688] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:58:36,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684671868] [2023-08-04 00:58:36,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:36,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:58:36,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:58:36,799 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 00:58:36,800 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 00:58:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:36,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 00:58:36,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:58:36,892 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 00:58:36,893 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:58:36,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684671868] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:58:36,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:58:36,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 00:58:36,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587704709] [2023-08-04 00:58:36,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:58:36,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 00:58:36,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:58:36,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 00:58:36,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:58:36,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 193 [2023-08-04 00:58:36,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 38 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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 00:58:36,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:58:36,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 193 [2023-08-04 00:58:36,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:58:37,273 INFO L124 PetriNetUnfolderBase]: 4672/7036 cut-off events. [2023-08-04 00:58:37,274 INFO L125 PetriNetUnfolderBase]: For 1198/1198 co-relation queries the response was YES. [2023-08-04 00:58:37,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14895 conditions, 7036 events. 4672/7036 cut-off events. For 1198/1198 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 40817 event pairs, 568 based on Foata normal form. 729/7764 useless extension candidates. Maximal degree in co-relation 7349. Up to 4212 conditions per place. [2023-08-04 00:58:37,283 INFO L140 encePairwiseOnDemand]: 191/193 looper letters, 0 selfloop transitions, 0 changer transitions 55/55 dead transitions. [2023-08-04 00:58:37,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 262 flow [2023-08-04 00:58:37,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:58:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:58:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-04 00:58:37,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.633419689119171 [2023-08-04 00:58:37,285 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-04 00:58:37,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-04 00:58:37,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:58:37,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-04 00:58:37,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 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 00:58:37,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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 00:58:37,287 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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 00:58:37,288 INFO L175 Difference]: Start difference. First operand has 62 places, 38 transitions, 138 flow. Second operand 4 states and 489 transitions. [2023-08-04 00:58:37,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 262 flow [2023-08-04 00:58:37,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 255 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 00:58:37,304 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2023-08-04 00:58:37,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2023-08-04 00:58:37,305 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-08-04 00:58:37,306 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2023-08-04 00:58:37,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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 00:58:37,307 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 00:58:37,307 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 00:58:37,307 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 00:58:37,314 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 00:58:37,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:58:37,510 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:58:37,511 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE,SAFE (1/2) [2023-08-04 00:58:37,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 290 flow [2023-08-04 00:58:37,590 INFO L124 PetriNetUnfolderBase]: 93/1304 cut-off events. [2023-08-04 00:58:37,590 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 00:58:37,593 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 35. Compared 8886 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 00:58:37,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 290 flow [2023-08-04 00:58:37,595 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 112 transitions, 248 flow [2023-08-04 00:58:37,595 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:58:37,595 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 112 transitions, 248 flow [2023-08-04 00:58:37,595 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 112 transitions, 248 flow [2023-08-04 00:58:37,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 112 transitions, 248 flow [2023-08-04 00:58:37,648 INFO L124 PetriNetUnfolderBase]: 66/967 cut-off events. [2023-08-04 00:58:37,649 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-04 00:58:37,650 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 6003 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 00:58:37,661 INFO L119 LiptonReduction]: Number of co-enabled transitions 3996 [2023-08-04 00:58:39,108 INFO L134 LiptonReduction]: Checked pairs total: 7901 [2023-08-04 00:58:39,108 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-08-04 00:58:39,109 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 00:58:39,109 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;@2ce8d0f0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:58:39,110 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 00:58:39,111 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:58:39,111 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-08-04 00:58:39,111 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:58:39,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:58:39,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 00:58:39,111 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:58:39,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:58:39,111 INFO L85 PathProgramCache]: Analyzing trace with hash 20121793, now seen corresponding path program 1 times [2023-08-04 00:58:39,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:58:39,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159287085] [2023-08-04 00:58:39,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:39,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:58:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:39,126 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 00:58:39,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:58:39,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159287085] [2023-08-04 00:58:39,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159287085] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:58:39,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:58:39,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:58:39,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388428047] [2023-08-04 00:58:39,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:58:39,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:58:39,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:58:39,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:58:39,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:58:39,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 209 [2023-08-04 00:58:39,135 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.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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 00:58:39,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:58:39,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 209 [2023-08-04 00:58:39,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:58:41,591 INFO L124 PetriNetUnfolderBase]: 33046/48143 cut-off events. [2023-08-04 00:58:41,592 INFO L125 PetriNetUnfolderBase]: For 1473/1473 co-relation queries the response was YES. [2023-08-04 00:58:41,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93534 conditions, 48143 events. 33046/48143 cut-off events. For 1473/1473 co-relation queries the response was YES. Maximal size of possible extension queue 1619. Compared 340544 event pairs, 26064 based on Foata normal form. 0/45325 useless extension candidates. Maximal degree in co-relation 26602. Up to 43520 conditions per place. [2023-08-04 00:58:41,838 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 31 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-04 00:58:41,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 174 flow [2023-08-04 00:58:41,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:58:41,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:58:41,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-04 00:58:41,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5869218500797448 [2023-08-04 00:58:41,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-04 00:58:41,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-04 00:58:41,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:58:41,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-04 00:58:41,841 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 00:58:41,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 00:58:41,842 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 00:58:41,842 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 102 flow. Second operand 3 states and 368 transitions. [2023-08-04 00:58:41,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 174 flow [2023-08-04 00:58:41,843 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 00:58:41,843 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 112 flow [2023-08-04 00:58:41,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, 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 00:58:41,844 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-04 00:58:41,844 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 112 flow [2023-08-04 00:58:41,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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 00:58:41,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:58:41,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:58:41,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 00:58:41,845 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:58:41,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:58:41,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1647622516, now seen corresponding path program 1 times [2023-08-04 00:58:41,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:58:41,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850430980] [2023-08-04 00:58:41,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:41,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:58:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:41,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 00:58:41,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:58:41,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850430980] [2023-08-04 00:58:41,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850430980] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:58:41,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935798467] [2023-08-04 00:58:41,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:41,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:58:41,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:58:41,877 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 00:58:41,879 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 00:58:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:41,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 00:58:41,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:58:41,941 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 00:58:41,942 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:58:41,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935798467] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:58:41,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:58:41,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 00:58:41,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517763367] [2023-08-04 00:58:41,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:58:41,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:58:41,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:58:41,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:58:41,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:58:41,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 209 [2023-08-04 00:58:41,951 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 00:58:41,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:58:41,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 209 [2023-08-04 00:58:41,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:58:43,769 INFO L124 PetriNetUnfolderBase]: 31406/45017 cut-off events. [2023-08-04 00:58:43,769 INFO L125 PetriNetUnfolderBase]: For 1287/1287 co-relation queries the response was YES. [2023-08-04 00:58:43,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87898 conditions, 45017 events. 31406/45017 cut-off events. For 1287/1287 co-relation queries the response was YES. Maximal size of possible extension queue 1602. Compared 310544 event pairs, 24928 based on Foata normal form. 0/42784 useless extension candidates. Maximal degree in co-relation 87861. Up to 40987 conditions per place. [2023-08-04 00:58:43,986 INFO L140 encePairwiseOnDemand]: 206/209 looper letters, 36 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-04 00:58:43,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 204 flow [2023-08-04 00:58:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:58:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:58:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-08-04 00:58:43,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5917065390749602 [2023-08-04 00:58:43,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-08-04 00:58:43,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-08-04 00:58:43,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:58:43,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-08-04 00:58:43,988 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 00:58:43,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 00:58:43,989 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 00:58:43,989 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 112 flow. Second operand 3 states and 371 transitions. [2023-08-04 00:58:43,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 204 flow [2023-08-04 00:58:43,990 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 00:58:43,991 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 122 flow [2023-08-04 00:58:43,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, 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 00:58:43,991 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2023-08-04 00:58:43,991 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 122 flow [2023-08-04 00:58:43,991 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 00:58:43,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:58:43,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:58:43,998 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 00:58:44,195 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 00:58:44,196 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:58:44,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:58:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash -622613019, now seen corresponding path program 1 times [2023-08-04 00:58:44,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:58:44,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121175622] [2023-08-04 00:58:44,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:44,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:58:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:44,224 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 00:58:44,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:58:44,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121175622] [2023-08-04 00:58:44,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121175622] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:58:44,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30278798] [2023-08-04 00:58:44,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:44,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:58:44,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:58:44,226 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 00:58:44,228 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 00:58:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:44,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 00:58:44,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:58:44,293 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 00:58:44,293 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:58:44,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30278798] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:58:44,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:58:44,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 00:58:44,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423247131] [2023-08-04 00:58:44,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:58:44,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:58:44,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:58:44,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:58:44,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:58:44,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 209 [2023-08-04 00:58:44,300 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 00:58:44,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:58:44,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 209 [2023-08-04 00:58:44,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:58:46,189 INFO L124 PetriNetUnfolderBase]: 30734/43358 cut-off events. [2023-08-04 00:58:46,189 INFO L125 PetriNetUnfolderBase]: For 833/833 co-relation queries the response was YES. [2023-08-04 00:58:46,266 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 290619 event pairs, 23582 based on Foata normal form. 0/41626 useless extension candidates. Maximal degree in co-relation 24344. Up to 37757 conditions per place. [2023-08-04 00:58:46,367 INFO L140 encePairwiseOnDemand]: 206/209 looper letters, 41 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-04 00:58:46,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 232 flow [2023-08-04 00:58:46,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:58:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:58:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-04 00:58:46,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5980861244019139 [2023-08-04 00:58:46,369 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-04 00:58:46,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-04 00:58:46,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:58:46,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-04 00:58:46,370 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 00:58:46,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 00:58:46,370 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 00:58:46,371 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 122 flow. Second operand 3 states and 375 transitions. [2023-08-04 00:58:46,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 232 flow [2023-08-04 00:58:46,372 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 00:58:46,372 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 132 flow [2023-08-04 00:58:46,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, 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 00:58:46,373 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-04 00:58:46,373 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 132 flow [2023-08-04 00:58:46,373 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 00:58:46,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:58:46,373 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 00:58:46,379 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 00:58:46,573 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 00:58:46,574 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:58:46,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:58:46,574 INFO L85 PathProgramCache]: Analyzing trace with hash 530500471, now seen corresponding path program 1 times [2023-08-04 00:58:46,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:58:46,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872613879] [2023-08-04 00:58:46,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:46,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:58:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:46,604 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 00:58:46,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:58:46,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872613879] [2023-08-04 00:58:46,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872613879] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:58:46,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297495456] [2023-08-04 00:58:46,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:46,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:58:46,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:58:46,609 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 00:58:46,611 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 00:58:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:46,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:58:46,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:58:46,682 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 00:58:46,682 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:58:46,693 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 00:58:46,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297495456] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:58:46,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:58:46,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 00:58:46,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985879886] [2023-08-04 00:58:46,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:58:46,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:58:46,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:58:46,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:58:46,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:58:46,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 209 [2023-08-04 00:58:46,706 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 00:58:46,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:58:46,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 209 [2023-08-04 00:58:46,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:58:48,152 INFO L124 PetriNetUnfolderBase]: 24232/33893 cut-off events. [2023-08-04 00:58:48,152 INFO L125 PetriNetUnfolderBase]: For 3624/3624 co-relation queries the response was YES. [2023-08-04 00:58:48,232 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 213857 event pairs, 14820 based on Foata normal form. 3/33868 useless extension candidates. Maximal degree in co-relation 24810. Up to 31258 conditions per place. [2023-08-04 00:58:48,326 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 36 selfloop transitions, 3 changer transitions 1/49 dead transitions. [2023-08-04 00:58:48,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 228 flow [2023-08-04 00:58:48,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:58:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:58:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-08-04 00:58:48,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5729665071770335 [2023-08-04 00:58:48,327 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-08-04 00:58:48,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-08-04 00:58:48,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:58:48,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-08-04 00:58:48,329 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 00:58:48,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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 00:58:48,330 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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 00:58:48,330 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 132 flow. Second operand 4 states and 479 transitions. [2023-08-04 00:58:48,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 228 flow [2023-08-04 00:58:48,332 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 00:58:48,333 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 144 flow [2023-08-04 00:58:48,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, 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 00:58:48,337 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-04 00:58:48,337 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 144 flow [2023-08-04 00:58:48,338 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 00:58:48,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:58:48,338 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 00:58:48,342 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 00:58:48,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:58:48,541 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:58:48,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:58:48,541 INFO L85 PathProgramCache]: Analyzing trace with hash -42188384, now seen corresponding path program 1 times [2023-08-04 00:58:48,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:58:48,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30896965] [2023-08-04 00:58:48,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:48,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:58:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:48,570 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 00:58:48,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:58:48,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30896965] [2023-08-04 00:58:48,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30896965] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:58:48,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566660222] [2023-08-04 00:58:48,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:48,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:58:48,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:58:48,572 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 00:58:48,574 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 00:58:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:48,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:58:48,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:58:48,649 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 00:58:48,649 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:58:48,660 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 00:58:48,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566660222] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:58:48,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:58:48,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 00:58:48,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329731913] [2023-08-04 00:58:48,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:58:48,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:58:48,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:58:48,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:58:48,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:58:48,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 209 [2023-08-04 00:58:48,671 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 00:58:48,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:58:48,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 209 [2023-08-04 00:58:48,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:58:49,849 INFO L124 PetriNetUnfolderBase]: 19198/26485 cut-off events. [2023-08-04 00:58:49,850 INFO L125 PetriNetUnfolderBase]: For 2439/2439 co-relation queries the response was YES. [2023-08-04 00:58:49,901 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 160015 event pairs, 11902 based on Foata normal form. 27/26511 useless extension candidates. Maximal degree in co-relation 19295. Up to 23785 conditions per place. [2023-08-04 00:58:49,967 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 44 selfloop transitions, 3 changer transitions 1/57 dead transitions. [2023-08-04 00:58:49,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 272 flow [2023-08-04 00:58:49,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:58:49,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:58:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-08-04 00:58:49,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5825358851674641 [2023-08-04 00:58:49,969 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-08-04 00:58:49,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-08-04 00:58:49,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:58:49,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-08-04 00:58:49,970 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 00:58:49,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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 00:58:49,971 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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 00:58:49,971 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 144 flow. Second operand 4 states and 487 transitions. [2023-08-04 00:58:49,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 272 flow [2023-08-04 00:58:49,973 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 00:58:49,974 INFO L231 Difference]: Finished difference. Result has 64 places, 41 transitions, 151 flow [2023-08-04 00:58:49,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, 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 00:58:49,974 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2023-08-04 00:58:49,974 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 41 transitions, 151 flow [2023-08-04 00:58:49,975 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 00:58:49,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:58:49,975 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 00:58:49,979 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 00:58:50,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 00:58:50,179 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:58:50,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:58:50,179 INFO L85 PathProgramCache]: Analyzing trace with hash -754161232, now seen corresponding path program 1 times [2023-08-04 00:58:50,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:58:50,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106277884] [2023-08-04 00:58:50,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:50,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:58:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:50,210 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 00:58:50,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:58:50,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106277884] [2023-08-04 00:58:50,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106277884] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:58:50,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713100515] [2023-08-04 00:58:50,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:50,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:58:50,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:58:50,212 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 00:58:50,214 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 00:58:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:50,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:58:50,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:58:50,290 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 00:58:50,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:58:50,300 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 00:58:50,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713100515] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:58:50,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:58:50,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 00:58:50,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19128175] [2023-08-04 00:58:50,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:58:50,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:58:50,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:58:50,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:58:50,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:58:50,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 209 [2023-08-04 00:58:50,310 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 00:58:50,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:58:50,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 209 [2023-08-04 00:58:50,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:58:51,353 INFO L124 PetriNetUnfolderBase]: 17362/23209 cut-off events. [2023-08-04 00:58:51,353 INFO L125 PetriNetUnfolderBase]: For 2377/2377 co-relation queries the response was YES. [2023-08-04 00:58:51,413 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 127849 event pairs, 6886 based on Foata normal form. 243/23451 useless extension candidates. Maximal degree in co-relation 17297. Up to 11794 conditions per place. [2023-08-04 00:58:51,487 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 52 selfloop transitions, 3 changer transitions 1/65 dead transitions. [2023-08-04 00:58:51,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 311 flow [2023-08-04 00:58:51,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:58:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:58:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2023-08-04 00:58:51,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5921052631578947 [2023-08-04 00:58:51,488 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 495 transitions. [2023-08-04 00:58:51,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 495 transitions. [2023-08-04 00:58:51,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:58:51,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 495 transitions. [2023-08-04 00:58:51,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 00:58:51,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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 00:58:51,491 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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 00:58:51,491 INFO L175 Difference]: Start difference. First operand has 64 places, 41 transitions, 151 flow. Second operand 4 states and 495 transitions. [2023-08-04 00:58:51,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 311 flow [2023-08-04 00:58:51,493 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 00:58:51,494 INFO L231 Difference]: Finished difference. Result has 66 places, 41 transitions, 158 flow [2023-08-04 00:58:51,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, 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 00:58:51,494 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2023-08-04 00:58:51,494 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 41 transitions, 158 flow [2023-08-04 00:58:51,494 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 00:58:51,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:58:51,494 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 00:58:51,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 00:58:51,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-04 00:58:51,699 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:58:51,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:58:51,700 INFO L85 PathProgramCache]: Analyzing trace with hash 439140675, now seen corresponding path program 1 times [2023-08-04 00:58:51,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:58:51,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111057243] [2023-08-04 00:58:51,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:58:51,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:58:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:58:51,842 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 00:58:51,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:58:51,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111057243] [2023-08-04 00:58:51,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111057243] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:58:51,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:58:51,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 00:58:51,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563850188] [2023-08-04 00:58:51,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:58:51,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:58:51,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:58:51,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:58:51,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:58:51,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 209 [2023-08-04 00:58:51,857 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 00:58:51,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:58:51,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 209 [2023-08-04 00:58:51,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:59:01,063 INFO L124 PetriNetUnfolderBase]: 149614/188497 cut-off events. [2023-08-04 00:59:01,063 INFO L125 PetriNetUnfolderBase]: For 88114/88114 co-relation queries the response was YES. [2023-08-04 00:59:01,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429095 conditions, 188497 events. 149614/188497 cut-off events. For 88114/88114 co-relation queries the response was YES. Maximal size of possible extension queue 5121. Compared 1041059 event pairs, 55078 based on Foata normal form. 3524/191988 useless extension candidates. Maximal degree in co-relation 135025. Up to 107253 conditions per place. [2023-08-04 00:59:02,065 INFO L140 encePairwiseOnDemand]: 197/209 looper letters, 56 selfloop transitions, 11 changer transitions 0/70 dead transitions. [2023-08-04 00:59:02,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 70 transitions, 397 flow [2023-08-04 00:59:02,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:59:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:59:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-08-04 00:59:02,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.583732057416268 [2023-08-04 00:59:02,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-08-04 00:59:02,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-08-04 00:59:02,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:59:02,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-08-04 00:59:02,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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 00:59:02,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 00:59:02,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 00:59:02,068 INFO L175 Difference]: Start difference. First operand has 66 places, 41 transitions, 158 flow. Second operand 3 states and 366 transitions. [2023-08-04 00:59:02,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 70 transitions, 397 flow [2023-08-04 00:59:02,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 70 transitions, 383 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 00:59:02,401 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 237 flow [2023-08-04 00:59:02,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, 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 00:59:02,402 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2023-08-04 00:59:02,402 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 237 flow [2023-08-04 00:59:02,402 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 00:59:02,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:59:02,402 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 00:59:02,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 00:59:02,402 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:59:02,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:59:02,403 INFO L85 PathProgramCache]: Analyzing trace with hash 728458292, now seen corresponding path program 1 times [2023-08-04 00:59:02,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:59:02,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650022208] [2023-08-04 00:59:02,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:59:02,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:59:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:59:02,517 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 00:59:02,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:59:02,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650022208] [2023-08-04 00:59:02,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650022208] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:59:02,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:59:02,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:59:02,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427420660] [2023-08-04 00:59:02,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:59:02,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 00:59:02,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:59:02,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 00:59:02,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 00:59:02,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 209 [2023-08-04 00:59:02,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 237 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 00:59:02,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:59:02,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 209 [2023-08-04 00:59:02,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:59:12,349 INFO L124 PetriNetUnfolderBase]: 147202/185457 cut-off events. [2023-08-04 00:59:12,350 INFO L125 PetriNetUnfolderBase]: For 133906/133906 co-relation queries the response was YES. [2023-08-04 00:59:12,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541132 conditions, 185457 events. 147202/185457 cut-off events. For 133906/133906 co-relation queries the response was YES. Maximal size of possible extension queue 5004. Compared 1022773 event pairs, 34962 based on Foata normal form. 240/185664 useless extension candidates. Maximal degree in co-relation 179062. Up to 102697 conditions per place. [2023-08-04 00:59:13,391 INFO L140 encePairwiseOnDemand]: 197/209 looper letters, 85 selfloop transitions, 15 changer transitions 0/103 dead transitions. [2023-08-04 00:59:13,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 103 transitions, 669 flow [2023-08-04 00:59:13,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:59:13,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:59:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2023-08-04 00:59:13,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5861244019138756 [2023-08-04 00:59:13,394 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 490 transitions. [2023-08-04 00:59:13,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 490 transitions. [2023-08-04 00:59:13,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:59:13,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 490 transitions. [2023-08-04 00:59:13,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 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 00:59:13,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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 00:59:13,396 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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 00:59:13,396 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 237 flow. Second operand 4 states and 490 transitions. [2023-08-04 00:59:13,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 103 transitions, 669 flow [2023-08-04 00:59:13,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 103 transitions, 631 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 00:59:13,737 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 333 flow [2023-08-04 00:59:13,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, 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=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=333, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-08-04 00:59:13,737 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-08-04 00:59:13,737 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 333 flow [2023-08-04 00:59:13,738 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 00:59:13,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:59:13,738 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 00:59:13,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 00:59:13,738 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:59:13,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:59:13,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1004222629, now seen corresponding path program 1 times [2023-08-04 00:59:13,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:59:13,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021177252] [2023-08-04 00:59:13,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:59:13,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:59:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:59:13,835 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 00:59:13,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:59:13,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021177252] [2023-08-04 00:59:13,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021177252] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:59:13,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:59:13,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:59:13,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620398660] [2023-08-04 00:59:13,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:59:13,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 00:59:13,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:59:13,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 00:59:13,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 00:59:13,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 209 [2023-08-04 00:59:13,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 333 flow. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 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 00:59:13,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:59:13,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 209 [2023-08-04 00:59:13,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:59:23,851 INFO L124 PetriNetUnfolderBase]: 145674/183421 cut-off events. [2023-08-04 00:59:23,852 INFO L125 PetriNetUnfolderBase]: For 198372/198372 co-relation queries the response was YES. [2023-08-04 00:59:24,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590859 conditions, 183421 events. 145674/183421 cut-off events. For 198372/198372 co-relation queries the response was YES. Maximal size of possible extension queue 4935. Compared 1009911 event pairs, 19238 based on Foata normal form. 192/183596 useless extension candidates. Maximal degree in co-relation 197909. Up to 97541 conditions per place. [2023-08-04 00:59:24,973 INFO L140 encePairwiseOnDemand]: 197/209 looper letters, 77 selfloop transitions, 25 changer transitions 0/105 dead transitions. [2023-08-04 00:59:24,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 105 transitions, 747 flow [2023-08-04 00:59:24,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:59:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:59:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-08-04 00:59:24,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5741626794258373 [2023-08-04 00:59:24,975 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-08-04 00:59:24,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-08-04 00:59:24,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:59:24,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-08-04 00:59:24,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 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 00:59:24,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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 00:59:24,977 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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 00:59:24,977 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 333 flow. Second operand 4 states and 480 transitions. [2023-08-04 00:59:24,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 105 transitions, 747 flow [2023-08-04 00:59:27,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 105 transitions, 747 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 00:59:27,040 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 535 flow [2023-08-04 00:59:27,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=535, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2023-08-04 00:59:27,041 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2023-08-04 00:59:27,041 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 535 flow [2023-08-04 00:59:27,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 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 00:59:27,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:59:27,041 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 00:59:27,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-04 00:59:27,041 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:59:27,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:59:27,042 INFO L85 PathProgramCache]: Analyzing trace with hash -545957796, now seen corresponding path program 1 times [2023-08-04 00:59:27,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:59:27,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866768117] [2023-08-04 00:59:27,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:59:27,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:59:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:59:27,137 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 00:59:27,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:59:27,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866768117] [2023-08-04 00:59:27,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866768117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:59:27,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:59:27,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 00:59:27,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777199096] [2023-08-04 00:59:27,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:59:27,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 00:59:27,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:59:27,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 00:59:27,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 00:59:27,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 209 [2023-08-04 00:59:27,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 535 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 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 00:59:27,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:59:27,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 209 [2023-08-04 00:59:27,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:59:39,876 INFO L124 PetriNetUnfolderBase]: 170810/215225 cut-off events. [2023-08-04 00:59:39,877 INFO L125 PetriNetUnfolderBase]: For 492636/492636 co-relation queries the response was YES. [2023-08-04 00:59:40,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799260 conditions, 215225 events. 170810/215225 cut-off events. For 492636/492636 co-relation queries the response was YES. Maximal size of possible extension queue 5968. Compared 1220244 event pairs, 37118 based on Foata normal form. 1680/216872 useless extension candidates. Maximal degree in co-relation 282831. Up to 96301 conditions per place. [2023-08-04 00:59:41,248 INFO L140 encePairwiseOnDemand]: 197/209 looper letters, 93 selfloop transitions, 39 changer transitions 0/135 dead transitions. [2023-08-04 00:59:41,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 135 transitions, 1167 flow [2023-08-04 00:59:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:59:41,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:59:41,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2023-08-04 00:59:41,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2023-08-04 00:59:41,250 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 494 transitions. [2023-08-04 00:59:41,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 494 transitions. [2023-08-04 00:59:41,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:59:41,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 494 transitions. [2023-08-04 00:59:41,251 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 00:59:41,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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 00:59:41,252 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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 00:59:41,252 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 535 flow. Second operand 4 states and 494 transitions. [2023-08-04 00:59:41,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 135 transitions, 1167 flow [2023-08-04 00:59:44,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 135 transitions, 1167 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 00:59:44,379 INFO L231 Difference]: Finished difference. Result has 83 places, 91 transitions, 905 flow [2023-08-04 00:59:44,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=905, PETRI_PLACES=83, PETRI_TRANSITIONS=91} [2023-08-04 00:59:44,379 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2023-08-04 00:59:44,380 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 91 transitions, 905 flow [2023-08-04 00:59:44,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 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 00:59:44,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:59:44,380 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 00:59:44,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-04 00:59:44,380 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:59:44,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:59:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash -32316200, now seen corresponding path program 1 times [2023-08-04 00:59:44,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:59:44,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600394416] [2023-08-04 00:59:44,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:59:44,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:59:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:59:44,453 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 00:59:44,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:59:44,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600394416] [2023-08-04 00:59:44,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600394416] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:59:44,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:59:44,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:59:44,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462544625] [2023-08-04 00:59:44,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:59:44,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:59:44,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:59:44,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:59:44,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:59:44,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 209 [2023-08-04 00:59:44,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 91 transitions, 905 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 00:59:44,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:59:44,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 209 [2023-08-04 00:59:44,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:59:45,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L746-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P1Thread2of2ForFork1_#res.base_12| 0) (= |v_P1Thread2of2ForFork1_#res.offset_12| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{P1Thread2of2ForFork1_#res.base=|v_P1Thread2of2ForFork1_#res.base_12|, P1Thread2of2ForFork1_#res.offset=|v_P1Thread2of2ForFork1_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} AuxVars[] AssignedVars[P1Thread2of2ForFork1_#res.base, P1Thread2of2ForFork1_#res.offset, ~__unbuffered_cnt~0][47], [113#P1EXITtrue, 30#L785-5true, P0Thread1of2ForFork0InUse, 451#(= 0 |ULTIMATE.start_main_~asdf~2#1|), P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 15#L731true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 449#true, Black: 603#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 623#true, 617#(= ~__unbuffered_p2_EAX~0 0), Black: 610#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~x~0 0), 29#L746true, 631#true, Black: 615#true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 626#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 625#(= ~x~0 1), P2Thread1of2ForFork2NotInUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:59:45,251 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2023-08-04 00:59:45,251 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-08-04 00:59:45,251 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-08-04 00:59:45,251 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-08-04 00:59:45,489 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L746-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P1Thread2of2ForFork1_#res.base_12| 0) (= |v_P1Thread2of2ForFork1_#res.offset_12| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{P1Thread2of2ForFork1_#res.base=|v_P1Thread2of2ForFork1_#res.base_12|, P1Thread2of2ForFork1_#res.offset=|v_P1Thread2of2ForFork1_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} AuxVars[] AssignedVars[P1Thread2of2ForFork1_#res.base, P1Thread2of2ForFork1_#res.offset, ~__unbuffered_cnt~0][47], [113#P1EXITtrue, P0Thread1of2ForFork0InUse, 451#(= 0 |ULTIMATE.start_main_~asdf~2#1|), P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 15#L731true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 449#true, 68#$Ultimate##0true, Black: 603#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 623#true, 617#(= ~__unbuffered_p2_EAX~0 0), Black: 610#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~x~0 0), 29#L746true, 631#true, Black: 615#true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 626#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 625#(= ~x~0 1), 35#L785-6true, P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:59:45,490 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is not cut-off event [2023-08-04 00:59:45,490 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-08-04 00:59:45,490 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-08-04 00:59:45,490 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-08-04 00:59:45,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([575] $Ultimate##0-->L758: Formula: (and (= v_P2Thread1of2ForFork2_~arg.base_8 |v_P2Thread1of2ForFork2_#in~arg.base_8|) (= |v_P2Thread1of2ForFork2_#in~arg.offset_8| v_P2Thread1of2ForFork2_~arg.offset_8) (= v_~x~0_45 v_~__unbuffered_p2_EAX~0_28)) InVars {P2Thread1of2ForFork2_#in~arg.offset=|v_P2Thread1of2ForFork2_#in~arg.offset_8|, P2Thread1of2ForFork2_#in~arg.base=|v_P2Thread1of2ForFork2_#in~arg.base_8|, ~x~0=v_~x~0_45} OutVars{P2Thread1of2ForFork2_#in~arg.offset=|v_P2Thread1of2ForFork2_#in~arg.offset_8|, P2Thread1of2ForFork2_~arg.base=v_P2Thread1of2ForFork2_~arg.base_8, P2Thread1of2ForFork2_#in~arg.base=|v_P2Thread1of2ForFork2_#in~arg.base_8|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_45, P2Thread1of2ForFork2_~arg.offset=v_P2Thread1of2ForFork2_~arg.offset_8} AuxVars[] AssignedVars[P2Thread1of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of2ForFork2_~arg.offset][70], [451#(= 0 |ULTIMATE.start_main_~asdf~2#1|), P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L758true, 633#(= ~__unbuffered_cnt~0 0), 15#L731true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 615#true, Black: 449#true, Black: 603#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 623#true, Black: 610#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~x~0 0), 29#L746true, Black: 617#(= ~__unbuffered_p2_EAX~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 626#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 625#(= ~x~0 1), 35#L785-6true, 93#L746true, P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:59:45,490 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is not cut-off event [2023-08-04 00:59:45,490 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-08-04 00:59:45,490 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-08-04 00:59:45,490 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-08-04 00:59:46,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L746-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P1Thread2of2ForFork1_#res.base_12| 0) (= |v_P1Thread2of2ForFork1_#res.offset_12| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{P1Thread2of2ForFork1_#res.base=|v_P1Thread2of2ForFork1_#res.base_12|, P1Thread2of2ForFork1_#res.offset=|v_P1Thread2of2ForFork1_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} AuxVars[] AssignedVars[P1Thread2of2ForFork1_#res.base, P1Thread2of2ForFork1_#res.offset, ~__unbuffered_cnt~0][47], [113#P1EXITtrue, P0Thread1of2ForFork0InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P0Thread2of2ForFork0InUse, 2#L785-11true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 15#L731true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, 68#$Ultimate##0true, Black: 603#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 623#true, 617#(= ~__unbuffered_p2_EAX~0 0), Black: 610#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~x~0 0), 29#L746true, 631#true, Black: 615#true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 626#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 625#(= ~x~0 1), P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:59:46,378 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2023-08-04 00:59:46,378 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-04 00:59:46,378 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-04 00:59:46,378 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-04 00:59:46,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([575] $Ultimate##0-->L758: Formula: (and (= v_P2Thread1of2ForFork2_~arg.base_8 |v_P2Thread1of2ForFork2_#in~arg.base_8|) (= |v_P2Thread1of2ForFork2_#in~arg.offset_8| v_P2Thread1of2ForFork2_~arg.offset_8) (= v_~x~0_45 v_~__unbuffered_p2_EAX~0_28)) InVars {P2Thread1of2ForFork2_#in~arg.offset=|v_P2Thread1of2ForFork2_#in~arg.offset_8|, P2Thread1of2ForFork2_#in~arg.base=|v_P2Thread1of2ForFork2_#in~arg.base_8|, ~x~0=v_~x~0_45} OutVars{P2Thread1of2ForFork2_#in~arg.offset=|v_P2Thread1of2ForFork2_#in~arg.offset_8|, P2Thread1of2ForFork2_~arg.base=v_P2Thread1of2ForFork2_~arg.base_8, P2Thread1of2ForFork2_#in~arg.base=|v_P2Thread1of2ForFork2_#in~arg.base_8|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_45, P2Thread1of2ForFork2_~arg.offset=v_P2Thread1of2ForFork2_~arg.offset_8} AuxVars[] AssignedVars[P2Thread1of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of2ForFork2_~arg.offset][70], [P0Thread1of2ForFork0InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P0Thread2of2ForFork0InUse, 2#L785-11true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L758true, 633#(= ~__unbuffered_cnt~0 0), 15#L731true, 615#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, Black: 603#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 623#true, Black: 610#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~x~0 0), 29#L746true, Black: 617#(= ~__unbuffered_p2_EAX~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 626#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 625#(= ~x~0 1), 93#L746true, P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:59:46,378 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2023-08-04 00:59:46,378 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-04 00:59:46,379 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-04 00:59:46,379 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-04 00:59:47,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L746-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P1Thread2of2ForFork1_#res.base_12| 0) (= |v_P1Thread2of2ForFork1_#res.offset_12| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{P1Thread2of2ForFork1_#res.base=|v_P1Thread2of2ForFork1_#res.base_12|, P1Thread2of2ForFork1_#res.offset=|v_P1Thread2of2ForFork1_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} AuxVars[] AssignedVars[P1Thread2of2ForFork1_#res.base, P1Thread2of2ForFork1_#res.offset, ~__unbuffered_cnt~0][47], [30#L785-5true, 113#P1EXITtrue, P0Thread1of2ForFork0InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 15#L731true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, 68#$Ultimate##0true, Black: 603#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 623#true, 617#(= ~__unbuffered_p2_EAX~0 0), Black: 610#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~x~0 0), 29#L746true, 631#true, Black: 615#true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 626#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 625#(= ~x~0 1), P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:59:47,112 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2023-08-04 00:59:47,112 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 00:59:47,112 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 00:59:47,112 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 00:59:47,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([575] $Ultimate##0-->L758: Formula: (and (= v_P2Thread1of2ForFork2_~arg.base_8 |v_P2Thread1of2ForFork2_#in~arg.base_8|) (= |v_P2Thread1of2ForFork2_#in~arg.offset_8| v_P2Thread1of2ForFork2_~arg.offset_8) (= v_~x~0_45 v_~__unbuffered_p2_EAX~0_28)) InVars {P2Thread1of2ForFork2_#in~arg.offset=|v_P2Thread1of2ForFork2_#in~arg.offset_8|, P2Thread1of2ForFork2_#in~arg.base=|v_P2Thread1of2ForFork2_#in~arg.base_8|, ~x~0=v_~x~0_45} OutVars{P2Thread1of2ForFork2_#in~arg.offset=|v_P2Thread1of2ForFork2_#in~arg.offset_8|, P2Thread1of2ForFork2_~arg.base=v_P2Thread1of2ForFork2_~arg.base_8, P2Thread1of2ForFork2_#in~arg.base=|v_P2Thread1of2ForFork2_#in~arg.base_8|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_45, P2Thread1of2ForFork2_~arg.offset=v_P2Thread1of2ForFork2_~arg.offset_8} AuxVars[] AssignedVars[P2Thread1of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of2ForFork2_~arg.offset][70], [30#L785-5true, P0Thread1of2ForFork0InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L758true, 633#(= ~__unbuffered_cnt~0 0), 15#L731true, 615#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, Black: 603#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 623#true, Black: 610#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~x~0 0), 29#L746true, Black: 617#(= ~__unbuffered_p2_EAX~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 626#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 625#(= ~x~0 1), 93#L746true, P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:59:47,113 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2023-08-04 00:59:47,113 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 00:59:47,113 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 00:59:47,113 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 00:59:47,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([575] $Ultimate##0-->L758: Formula: (and (= v_P2Thread1of2ForFork2_~arg.base_8 |v_P2Thread1of2ForFork2_#in~arg.base_8|) (= |v_P2Thread1of2ForFork2_#in~arg.offset_8| v_P2Thread1of2ForFork2_~arg.offset_8) (= v_~x~0_45 v_~__unbuffered_p2_EAX~0_28)) InVars {P2Thread1of2ForFork2_#in~arg.offset=|v_P2Thread1of2ForFork2_#in~arg.offset_8|, P2Thread1of2ForFork2_#in~arg.base=|v_P2Thread1of2ForFork2_#in~arg.base_8|, ~x~0=v_~x~0_45} OutVars{P2Thread1of2ForFork2_#in~arg.offset=|v_P2Thread1of2ForFork2_#in~arg.offset_8|, P2Thread1of2ForFork2_~arg.base=v_P2Thread1of2ForFork2_~arg.base_8, P2Thread1of2ForFork2_#in~arg.base=|v_P2Thread1of2ForFork2_#in~arg.base_8|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_45, P2Thread1of2ForFork2_~arg.offset=v_P2Thread1of2ForFork2_~arg.offset_8} AuxVars[] AssignedVars[P2Thread1of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of2ForFork2_~arg.offset][70], [P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L758true, 633#(= ~__unbuffered_cnt~0 0), 15#L731true, 615#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, 98#$Ultimate##0true, Black: 603#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 623#true, Black: 610#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~x~0 0), 29#L746true, Black: 617#(= ~__unbuffered_p2_EAX~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 626#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 625#(= ~x~0 1), 35#L785-6true, 93#L746true, P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:59:47,114 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 00:59:47,114 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 00:59:47,114 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 00:59:47,114 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 00:59:47,930 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L746-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P1Thread2of2ForFork1_#res.base_12| 0) (= |v_P1Thread2of2ForFork1_#res.offset_12| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{P1Thread2of2ForFork1_#res.base=|v_P1Thread2of2ForFork1_#res.base_12|, P1Thread2of2ForFork1_#res.offset=|v_P1Thread2of2ForFork1_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} AuxVars[] AssignedVars[P1Thread2of2ForFork1_#res.base, P1Thread2of2ForFork1_#res.offset, ~__unbuffered_cnt~0][47], [P2Thread2of2ForFork2InUse, 113#P1EXITtrue, P0Thread1of2ForFork0InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 15#L731true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, 98#$Ultimate##0true, 68#$Ultimate##0true, Black: 603#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 623#true, 617#(= ~__unbuffered_p2_EAX~0 0), Black: 610#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~x~0 0), 29#L746true, 631#true, Black: 615#true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 626#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 625#(= ~x~0 1), 35#L785-6true, P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:59:47,930 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2023-08-04 00:59:47,930 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 00:59:47,930 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 00:59:47,930 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 00:59:47,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] $Ultimate##0-->L758: Formula: (and (= |v_P2Thread2of2ForFork2_#in~arg.offset_8| v_P2Thread2of2ForFork2_~arg.offset_8) (= v_P2Thread2of2ForFork2_~arg.base_8 |v_P2Thread2of2ForFork2_#in~arg.base_8|) (= v_~x~0_47 v_~__unbuffered_p2_EAX~0_30)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_8|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_8|, ~x~0=v_~x~0_47} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_8|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_8|, ~x~0=v_~x~0_47, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_8} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][109], [P2Thread2of2ForFork2InUse, 111#L758true, P0Thread1of2ForFork0InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 633#(= ~__unbuffered_cnt~0 0), 15#L731true, 615#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, Black: 603#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 68#$Ultimate##0true, 607#true, 623#true, Black: 610#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~x~0 0), 29#L746true, Black: 617#(= ~__unbuffered_p2_EAX~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 626#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 625#(= ~x~0 1), 35#L785-6true, 93#L746true, P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:59:47,931 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2023-08-04 00:59:47,931 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 00:59:47,931 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 00:59:47,931 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 00:59:48,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([575] $Ultimate##0-->L758: Formula: (and (= v_P2Thread1of2ForFork2_~arg.base_8 |v_P2Thread1of2ForFork2_#in~arg.base_8|) (= |v_P2Thread1of2ForFork2_#in~arg.offset_8| v_P2Thread1of2ForFork2_~arg.offset_8) (= v_~x~0_45 v_~__unbuffered_p2_EAX~0_28)) InVars {P2Thread1of2ForFork2_#in~arg.offset=|v_P2Thread1of2ForFork2_#in~arg.offset_8|, P2Thread1of2ForFork2_#in~arg.base=|v_P2Thread1of2ForFork2_#in~arg.base_8|, ~x~0=v_~x~0_45} OutVars{P2Thread1of2ForFork2_#in~arg.offset=|v_P2Thread1of2ForFork2_#in~arg.offset_8|, P2Thread1of2ForFork2_~arg.base=v_P2Thread1of2ForFork2_~arg.base_8, P2Thread1of2ForFork2_#in~arg.base=|v_P2Thread1of2ForFork2_#in~arg.base_8|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_45, P2Thread1of2ForFork2_~arg.offset=v_P2Thread1of2ForFork2_~arg.offset_8} AuxVars[] AssignedVars[P2Thread1of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of2ForFork2_~arg.offset][70], [P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 2#L785-11true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L758true, 633#(= ~__unbuffered_cnt~0 0), 15#L731true, 615#true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 98#$Ultimate##0true, Black: 603#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 623#true, Black: 610#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~x~0 0), 29#L746true, Black: 617#(= ~__unbuffered_p2_EAX~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 626#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 625#(= ~x~0 1), 93#L746true, P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:59:48,627 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-04 00:59:48,627 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 00:59:48,627 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 00:59:48,627 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 00:59:49,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([595] L746-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P1Thread2of2ForFork1_#res.base_12| 0) (= |v_P1Thread2of2ForFork1_#res.offset_12| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{P1Thread2of2ForFork1_#res.base=|v_P1Thread2of2ForFork1_#res.base_12|, P1Thread2of2ForFork1_#res.offset=|v_P1Thread2of2ForFork1_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} AuxVars[] AssignedVars[P1Thread2of2ForFork1_#res.base, P1Thread2of2ForFork1_#res.offset, ~__unbuffered_cnt~0][47], [P2Thread2of2ForFork2InUse, 113#P1EXITtrue, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 2#L785-11true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 15#L731true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 98#$Ultimate##0true, 68#$Ultimate##0true, Black: 603#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 607#true, 623#true, 617#(= ~__unbuffered_p2_EAX~0 0), Black: 610#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~x~0 0), 29#L746true, 631#true, Black: 615#true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 626#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 625#(= ~x~0 1), P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:59:49,637 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-08-04 00:59:49,637 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 00:59:49,637 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 00:59:49,637 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 00:59:49,638 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] $Ultimate##0-->L758: Formula: (and (= |v_P2Thread2of2ForFork2_#in~arg.offset_8| v_P2Thread2of2ForFork2_~arg.offset_8) (= v_P2Thread2of2ForFork2_~arg.base_8 |v_P2Thread2of2ForFork2_#in~arg.base_8|) (= v_~x~0_47 v_~__unbuffered_p2_EAX~0_30)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_8|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_8|, ~x~0=v_~x~0_47} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_8|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_8|, ~x~0=v_~x~0_47, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_8} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][109], [P2Thread2of2ForFork2InUse, 111#L758true, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 2#L785-11true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 633#(= ~__unbuffered_cnt~0 0), 15#L731true, 615#true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 68#$Ultimate##0true, 607#true, 623#true, Black: 610#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 609#(= ~x~0 0), 29#L746true, Black: 617#(= ~__unbuffered_p2_EAX~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 626#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 625#(= ~x~0 1), 93#L746true, P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:59:49,638 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-08-04 00:59:49,638 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 00:59:49,638 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 00:59:49,638 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 00:59:54,464 INFO L124 PetriNetUnfolderBase]: 101460/135127 cut-off events. [2023-08-04 00:59:54,464 INFO L125 PetriNetUnfolderBase]: For 666408/699206 co-relation queries the response was YES. [2023-08-04 00:59:54,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526368 conditions, 135127 events. 101460/135127 cut-off events. For 666408/699206 co-relation queries the response was YES. Maximal size of possible extension queue 6045. Compared 912653 event pairs, 21077 based on Foata normal form. 4574/129267 useless extension candidates. Maximal degree in co-relation 406910. Up to 110529 conditions per place. [2023-08-04 00:59:55,530 INFO L140 encePairwiseOnDemand]: 201/209 looper letters, 105 selfloop transitions, 7 changer transitions 0/145 dead transitions. [2023-08-04 00:59:55,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 145 transitions, 1620 flow [2023-08-04 00:59:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:59:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:59:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-08-04 00:59:55,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6044657097288676 [2023-08-04 00:59:55,531 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-08-04 00:59:55,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-08-04 00:59:55,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:59:55,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-08-04 00:59:55,532 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 00:59:55,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 00:59:55,533 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 00:59:55,533 INFO L175 Difference]: Start difference. First operand has 83 places, 91 transitions, 905 flow. Second operand 3 states and 379 transitions. [2023-08-04 00:59:55,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 145 transitions, 1620 flow [2023-08-04 00:59:56,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 145 transitions, 1620 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 00:59:56,116 INFO L231 Difference]: Finished difference. Result has 86 places, 97 transitions, 952 flow [2023-08-04 00:59:56,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=952, PETRI_PLACES=86, PETRI_TRANSITIONS=97} [2023-08-04 00:59:56,116 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 35 predicate places. [2023-08-04 00:59:56,116 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 97 transitions, 952 flow [2023-08-04 00:59:56,116 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 00:59:56,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:59:56,117 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 00:59:56,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-04 00:59:56,117 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:59:56,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:59:56,117 INFO L85 PathProgramCache]: Analyzing trace with hash 335370952, now seen corresponding path program 1 times [2023-08-04 00:59:56,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:59:56,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617585683] [2023-08-04 00:59:56,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:59:56,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:59:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:59:56,324 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 00:59:56,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:59:56,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617585683] [2023-08-04 00:59:56,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617585683] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:59:56,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682911117] [2023-08-04 00:59:56,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:59:56,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:59:56,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:59:56,327 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:59:56,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-04 00:59:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:59:56,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-04 00:59:56,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:59:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 00:59:56,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:59:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 00:59:56,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682911117] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:59:56,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:59:56,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 12 [2023-08-04 00:59:56,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994962472] [2023-08-04 00:59:56,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:59:56,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-04 00:59:56,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:59:56,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-04 00:59:56,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2023-08-04 00:59:56,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 209 [2023-08-04 00:59:56,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 97 transitions, 952 flow. Second operand has 13 states, 13 states have (on average 99.07692307692308) internal successors, (1288), 13 states have internal predecessors, (1288), 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 00:59:56,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:59:56,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 209 [2023-08-04 00:59:56,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:00:17,097 INFO L124 PetriNetUnfolderBase]: 216696/276848 cut-off events. [2023-08-04 01:00:17,097 INFO L125 PetriNetUnfolderBase]: For 1395706/1395706 co-relation queries the response was YES. [2023-08-04 01:00:18,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275679 conditions, 276848 events. 216696/276848 cut-off events. For 1395706/1395706 co-relation queries the response was YES. Maximal size of possible extension queue 8619. Compared 1689360 event pairs, 5822 based on Foata normal form. 7957/284776 useless extension candidates. Maximal degree in co-relation 1026925. Up to 93904 conditions per place. [2023-08-04 01:00:19,363 INFO L140 encePairwiseOnDemand]: 190/209 looper letters, 319 selfloop transitions, 443 changer transitions 0/765 dead transitions. [2023-08-04 01:00:19,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 765 transitions, 8555 flow [2023-08-04 01:00:19,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-04 01:00:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-04 01:00:19,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2132 transitions. [2023-08-04 01:00:19,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5667198298777246 [2023-08-04 01:00:19,367 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2132 transitions. [2023-08-04 01:00:19,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2132 transitions. [2023-08-04 01:00:19,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:00:19,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2132 transitions. [2023-08-04 01:00:19,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 118.44444444444444) internal successors, (2132), 18 states have internal predecessors, (2132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:00:19,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 209.0) internal successors, (3971), 19 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:00:19,374 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 209.0) internal successors, (3971), 19 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:00:19,374 INFO L175 Difference]: Start difference. First operand has 86 places, 97 transitions, 952 flow. Second operand 18 states and 2132 transitions. [2023-08-04 01:00:19,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 765 transitions, 8555 flow [2023-08-04 01:00:23,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 765 transitions, 8534 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:00:23,338 INFO L231 Difference]: Finished difference. Result has 115 places, 523 transitions, 7410 flow [2023-08-04 01:00:23,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=945, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=7410, PETRI_PLACES=115, PETRI_TRANSITIONS=523} [2023-08-04 01:00:23,339 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 64 predicate places. [2023-08-04 01:00:23,339 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 523 transitions, 7410 flow [2023-08-04 01:00:23,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 99.07692307692308) internal successors, (1288), 13 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:00:23,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:00:23,339 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] [2023-08-04 01:00:23,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-04 01:00:23,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:00:23,540 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:00:23,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:00:23,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1155128947, now seen corresponding path program 1 times [2023-08-04 01:00:23,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:00:23,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061153238] [2023-08-04 01:00:23,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:00:23,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:00:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:00:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 01:00:23,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:00:23,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061153238] [2023-08-04 01:00:23,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061153238] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:00:23,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037032952] [2023-08-04 01:00:23,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:00:23,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:00:23,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:00:23,641 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:00:23,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-04 01:00:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:00:23,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-04 01:00:23,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:00:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 01:00:23,881 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:00:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 01:00:24,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037032952] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:00:24,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:00:24,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 17 [2023-08-04 01:00:24,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820815124] [2023-08-04 01:00:24,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:00:24,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-04 01:00:24,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:00:24,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-04 01:00:24,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2023-08-04 01:00:24,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 209 [2023-08-04 01:00:24,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 523 transitions, 7410 flow. Second operand has 18 states, 18 states have (on average 94.77777777777777) internal successors, (1706), 18 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:00:24,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:00:24,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 209 [2023-08-04 01:00:24,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:01:16,357 INFO L124 PetriNetUnfolderBase]: 352130/453889 cut-off events. [2023-08-04 01:01:16,357 INFO L125 PetriNetUnfolderBase]: For 4971083/4971083 co-relation queries the response was YES. [2023-08-04 01:01:18,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2819876 conditions, 453889 events. 352130/453889 cut-off events. For 4971083/4971083 co-relation queries the response was YES. Maximal size of possible extension queue 17563. Compared 3043452 event pairs, 4032 based on Foata normal form. 15118/468781 useless extension candidates. Maximal degree in co-relation 2819735. Up to 139635 conditions per place. [2023-08-04 01:01:21,030 INFO L140 encePairwiseOnDemand]: 188/209 looper letters, 827 selfloop transitions, 2119 changer transitions 0/2949 dead transitions. [2023-08-04 01:01:21,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 2949 transitions, 41581 flow [2023-08-04 01:01:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-08-04 01:01:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-08-04 01:01:21,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 5504 transitions. [2023-08-04 01:01:21,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5486443381180224 [2023-08-04 01:01:21,039 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 5504 transitions. [2023-08-04 01:01:21,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 5504 transitions. [2023-08-04 01:01:21,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:01:21,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 5504 transitions. [2023-08-04 01:01:21,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 114.66666666666667) internal successors, (5504), 48 states have internal predecessors, (5504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:01:21,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 209.0) internal successors, (10241), 49 states have internal predecessors, (10241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:01:21,058 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 209.0) internal successors, (10241), 49 states have internal predecessors, (10241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:01:21,058 INFO L175 Difference]: Start difference. First operand has 115 places, 523 transitions, 7410 flow. Second operand 48 states and 5504 transitions. [2023-08-04 01:01:21,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 2949 transitions, 41581 flow Received shutdown request... [2023-08-04 01:12:19,772 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 01:12:19,773 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 01:12:20,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2023-08-04 01:12:20,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown