/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe023_tso_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 07:13:48,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 07:13:48,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 07:13:48,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 07:13:48,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 07:13:48,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 07:13:48,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 07:13:48,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 07:13:48,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 07:13:48,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 07:13:48,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 07:13:48,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 07:13:48,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 07:13:48,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 07:13:48,936 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 07:13:48,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 07:13:48,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 07:13:48,937 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 07:13:48,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 07:13:48,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 07:13:48,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 07:13:48,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 07:13:48,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 07:13:48,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 07:13:48,938 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 07:13:48,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 07:13:48,939 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 07:13:48,939 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 07:13:48,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 07:13:48,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 07:13:48,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:13:48,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 07:13:48,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 07:13:48,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 07:13:48,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 07:13:48,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 07:13:48,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 07:13:48,942 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 07:13:48,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 07:13:48,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 07:13:48,942 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 07:13:48,943 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 07:13:49,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 07:13:49,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 07:13:49,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 07:13:49,196 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 07:13:49,196 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 07:13:49,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe023_tso_bound2.i [2023-08-04 07:13:50,316 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 07:13:50,541 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 07:13:50,542 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe023_tso_bound2.i [2023-08-04 07:13:50,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a54d6ce4/ffa9db8962e94ea8984fdf0bf16455d2/FLAGf06fe5253 [2023-08-04 07:13:50,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a54d6ce4/ffa9db8962e94ea8984fdf0bf16455d2 [2023-08-04 07:13:50,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 07:13:50,586 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 07:13:50,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 07:13:50,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 07:13:50,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 07:13:50,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:13:50" (1/1) ... [2023-08-04 07:13:50,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5401deea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:50, skipping insertion in model container [2023-08-04 07:13:50,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:13:50" (1/1) ... [2023-08-04 07:13:50,648 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 07:13:50,802 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_safe023_tso_bound2.i[945,958] [2023-08-04 07:13:50,974 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:13:50,987 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 07:13:50,999 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_safe023_tso_bound2.i[945,958] [2023-08-04 07:13:51,018 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 07:13:51,020 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 07:13:51,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:13:51,075 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:13:51,076 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:13:51,081 INFO L206 MainTranslator]: Completed translation [2023-08-04 07:13:51,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:51 WrapperNode [2023-08-04 07:13:51,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 07:13:51,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 07:13:51,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 07:13:51,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 07:13:51,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:51" (1/1) ... [2023-08-04 07:13:51,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:51" (1/1) ... [2023-08-04 07:13:51,141 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2023-08-04 07:13:51,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 07:13:51,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 07:13:51,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 07:13:51,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 07:13:51,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:51" (1/1) ... [2023-08-04 07:13:51,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:51" (1/1) ... [2023-08-04 07:13:51,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:51" (1/1) ... [2023-08-04 07:13:51,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:51" (1/1) ... [2023-08-04 07:13:51,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:51" (1/1) ... [2023-08-04 07:13:51,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:51" (1/1) ... [2023-08-04 07:13:51,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:51" (1/1) ... [2023-08-04 07:13:51,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:51" (1/1) ... [2023-08-04 07:13:51,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 07:13:51,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 07:13:51,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 07:13:51,178 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 07:13:51,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:51" (1/1) ... [2023-08-04 07:13:51,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:13:51,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:13:51,218 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 07:13:51,223 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 07:13:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 07:13:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 07:13:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 07:13:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 07:13:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 07:13:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 07:13:51,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 07:13:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 07:13:51,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 07:13:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 07:13:51,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 07:13:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 07:13:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 07:13:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 07:13:51,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 07:13:51,248 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 07:13:51,353 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 07:13:51,355 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 07:13:51,512 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 07:13:51,519 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 07:13:51,519 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 07:13:51,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:13:51 BoogieIcfgContainer [2023-08-04 07:13:51,521 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 07:13:51,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 07:13:51,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 07:13:51,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 07:13:51,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 07:13:50" (1/3) ... [2023-08-04 07:13:51,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65940451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:13:51, skipping insertion in model container [2023-08-04 07:13:51,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:13:51" (2/3) ... [2023-08-04 07:13:51,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65940451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:13:51, skipping insertion in model container [2023-08-04 07:13:51,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:13:51" (3/3) ... [2023-08-04 07:13:51,529 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe023_tso_bound2.i [2023-08-04 07:13:51,534 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 07:13:51,540 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 07:13:51,540 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 07:13:51,540 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 07:13:51,586 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:13:51,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 106 transitions, 227 flow [2023-08-04 07:13:51,723 INFO L124 PetriNetUnfolderBase]: 30/414 cut-off events. [2023-08-04 07:13:51,723 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:51,730 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 07:13:51,730 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 106 transitions, 227 flow [2023-08-04 07:13:51,734 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 91 transitions, 191 flow [2023-08-04 07:13:51,736 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:13:51,743 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 91 transitions, 191 flow [2023-08-04 07:13:51,745 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 91 transitions, 191 flow [2023-08-04 07:13:51,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 91 transitions, 191 flow [2023-08-04 07:13:51,786 INFO L124 PetriNetUnfolderBase]: 22/311 cut-off events. [2023-08-04 07:13:51,786 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:51,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 311 events. 22/311 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1253 event pairs, 0 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 189. Up to 16 conditions per place. [2023-08-04 07:13:51,790 INFO L119 LiptonReduction]: Number of co-enabled transitions 1620 [2023-08-04 07:13:53,577 INFO L134 LiptonReduction]: Checked pairs total: 2845 [2023-08-04 07:13:53,577 INFO L136 LiptonReduction]: Total number of compositions: 76 [2023-08-04 07:13:53,602 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:13:53,608 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;@597dd547, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:13:53,608 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 07:13:53,616 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:13:53,616 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-04 07:13:53,616 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:53,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:53,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 07:13:53,618 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:53,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:53,623 INFO L85 PathProgramCache]: Analyzing trace with hash 356449654, now seen corresponding path program 1 times [2023-08-04 07:13:53,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:53,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29633257] [2023-08-04 07:13:53,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:53,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:53,888 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 07:13:53,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:53,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29633257] [2023-08-04 07:13:53,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29633257] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:13:53,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:13:53,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:13:53,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730301004] [2023-08-04 07:13:53,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:13:53,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:13:53,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:53,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:13:53,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:13:53,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 182 [2023-08-04 07:13:53,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:53,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:53,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 182 [2023-08-04 07:13:53,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:54,053 INFO L124 PetriNetUnfolderBase]: 400/736 cut-off events. [2023-08-04 07:13:54,053 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:54,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 736 events. 400/736 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3719 event pairs, 222 based on Foata normal form. 0/670 useless extension candidates. Maximal degree in co-relation 1432. Up to 668 conditions per place. [2023-08-04 07:13:54,059 INFO L140 encePairwiseOnDemand]: 178/182 looper letters, 20 selfloop transitions, 2 changer transitions 1/26 dead transitions. [2023-08-04 07:13:54,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 107 flow [2023-08-04 07:13:54,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:13:54,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:13:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-08-04 07:13:54,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5567765567765568 [2023-08-04 07:13:54,072 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-08-04 07:13:54,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-08-04 07:13:54,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:54,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-08-04 07:13:54,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:54,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:54,084 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:54,086 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 57 flow. Second operand 3 states and 304 transitions. [2023-08-04 07:13:54,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 107 flow [2023-08-04 07:13:54,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 107 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:13:54,090 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 63 flow [2023-08-04 07:13:54,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-08-04 07:13:54,095 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-08-04 07:13:54,095 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 63 flow [2023-08-04 07:13:54,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:54,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:54,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:13:54,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 07:13:54,096 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:54,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1087985545, now seen corresponding path program 1 times [2023-08-04 07:13:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:54,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968667036] [2023-08-04 07:13:54,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:54,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:54,226 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 07:13:54,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:54,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968667036] [2023-08-04 07:13:54,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968667036] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:13:54,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913481858] [2023-08-04 07:13:54,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:54,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:54,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:13:54,230 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 07:13:54,238 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 07:13:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:54,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:13:54,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:13:54,337 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 07:13:54,338 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:13:54,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913481858] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:13:54,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:13:54,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:13:54,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302947603] [2023-08-04 07:13:54,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:13:54,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:13:54,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:54,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:13:54,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:13:54,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 182 [2023-08-04 07:13:54,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:54,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:54,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 182 [2023-08-04 07:13:54,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:54,437 INFO L124 PetriNetUnfolderBase]: 338/604 cut-off events. [2023-08-04 07:13:54,437 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 07:13:54,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 604 events. 338/604 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2732 event pairs, 262 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 1184. Up to 529 conditions per place. [2023-08-04 07:13:54,444 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 22 selfloop transitions, 2 changer transitions 1/28 dead transitions. [2023-08-04 07:13:54,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 28 transitions, 123 flow [2023-08-04 07:13:54,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:13:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:13:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2023-08-04 07:13:54,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5586080586080586 [2023-08-04 07:13:54,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 305 transitions. [2023-08-04 07:13:54,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 305 transitions. [2023-08-04 07:13:54,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:54,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 305 transitions. [2023-08-04 07:13:54,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:54,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:54,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:54,461 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 63 flow. Second operand 3 states and 305 transitions. [2023-08-04 07:13:54,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 28 transitions, 123 flow [2023-08-04 07:13:54,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 119 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:13:54,463 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 67 flow [2023-08-04 07:13:54,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-08-04 07:13:54,464 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2023-08-04 07:13:54,464 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 67 flow [2023-08-04 07:13:54,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:54,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:54,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:13:54,473 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 07:13:54,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:54,670 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:54,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:54,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1614153841, now seen corresponding path program 1 times [2023-08-04 07:13:54,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:54,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586920166] [2023-08-04 07:13:54,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:54,761 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 07:13:54,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:54,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586920166] [2023-08-04 07:13:54,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586920166] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:13:54,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567855959] [2023-08-04 07:13:54,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:54,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:54,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:13:54,769 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 07:13:54,796 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 07:13:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:54,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:13:54,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:13:54,863 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 07:13:54,867 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:13:54,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567855959] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:13:54,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:13:54,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:13:54,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575508678] [2023-08-04 07:13:54,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:13:54,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:13:54,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:54,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:13:54,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:13:54,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 182 [2023-08-04 07:13:54,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:54,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:54,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 182 [2023-08-04 07:13:54,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:54,966 INFO L124 PetriNetUnfolderBase]: 314/526 cut-off events. [2023-08-04 07:13:54,966 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-04 07:13:54,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1107 conditions, 526 events. 314/526 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2315 event pairs, 182 based on Foata normal form. 0/495 useless extension candidates. Maximal degree in co-relation 1091. Up to 407 conditions per place. [2023-08-04 07:13:54,970 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 24 selfloop transitions, 2 changer transitions 1/30 dead transitions. [2023-08-04 07:13:54,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 30 transitions, 135 flow [2023-08-04 07:13:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:13:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:13:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-08-04 07:13:54,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5622710622710623 [2023-08-04 07:13:54,973 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-08-04 07:13:54,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-08-04 07:13:54,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:54,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-08-04 07:13:54,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:54,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:54,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:54,976 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 67 flow. Second operand 3 states and 307 transitions. [2023-08-04 07:13:54,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 30 transitions, 135 flow [2023-08-04 07:13:54,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:13:54,978 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 71 flow [2023-08-04 07:13:54,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-08-04 07:13:54,979 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-08-04 07:13:54,979 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 71 flow [2023-08-04 07:13:54,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:54,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:54,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:13:54,987 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 07:13:55,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-04 07:13:55,185 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:55,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:55,186 INFO L85 PathProgramCache]: Analyzing trace with hash 782053036, now seen corresponding path program 1 times [2023-08-04 07:13:55,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:55,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752443278] [2023-08-04 07:13:55,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:55,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:55,241 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 07:13:55,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:55,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752443278] [2023-08-04 07:13:55,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752443278] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:13:55,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077447733] [2023-08-04 07:13:55,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:55,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:55,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:13:55,243 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 07:13:55,273 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 07:13:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:55,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:13:55,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:13:55,369 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 07:13:55,370 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:13:55,389 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 07:13:55,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077447733] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:13:55,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:13:55,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:13:55,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156011546] [2023-08-04 07:13:55,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:13:55,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:13:55,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:55,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:13:55,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:13:55,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 182 [2023-08-04 07:13:55,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:55,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:55,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 182 [2023-08-04 07:13:55,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:55,452 INFO L124 PetriNetUnfolderBase]: 4/16 cut-off events. [2023-08-04 07:13:55,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:55,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 16 events. 4/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 3/19 useless extension candidates. Maximal degree in co-relation 36. Up to 10 conditions per place. [2023-08-04 07:13:55,454 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 0 selfloop transitions, 0 changer transitions 10/10 dead transitions. [2023-08-04 07:13:55,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 10 transitions, 43 flow [2023-08-04 07:13:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:13:55,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:13:55,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2023-08-04 07:13:55,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2023-08-04 07:13:55,456 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 378 transitions. [2023-08-04 07:13:55,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 378 transitions. [2023-08-04 07:13:55,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:55,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 378 transitions. [2023-08-04 07:13:55,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:55,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:55,459 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:55,460 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 71 flow. Second operand 4 states and 378 transitions. [2023-08-04 07:13:55,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 10 transitions, 43 flow [2023-08-04 07:13:55,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 10 transitions, 41 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:13:55,460 INFO L231 Difference]: Finished difference. Result has 18 places, 0 transitions, 0 flow [2023-08-04 07:13:55,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=18, PETRI_TRANSITIONS=0} [2023-08-04 07:13:55,462 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -12 predicate places. [2023-08-04 07:13:55,462 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 0 transitions, 0 flow [2023-08-04 07:13:55,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:55,465 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 07:13:55,473 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 07:13:55,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:55,671 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 07:13:55,672 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 07:13:55,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 106 transitions, 227 flow [2023-08-04 07:13:55,704 INFO L124 PetriNetUnfolderBase]: 30/414 cut-off events. [2023-08-04 07:13:55,704 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:55,705 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 07:13:55,705 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 106 transitions, 227 flow [2023-08-04 07:13:55,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 171 flow [2023-08-04 07:13:55,706 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:13:55,706 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 171 flow [2023-08-04 07:13:55,706 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 171 flow [2023-08-04 07:13:55,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 171 flow [2023-08-04 07:13:55,717 INFO L124 PetriNetUnfolderBase]: 6/190 cut-off events. [2023-08-04 07:13:55,718 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:55,718 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 07:13:55,719 INFO L119 LiptonReduction]: Number of co-enabled transitions 1116 [2023-08-04 07:13:57,201 INFO L134 LiptonReduction]: Checked pairs total: 2116 [2023-08-04 07:13:57,201 INFO L136 LiptonReduction]: Total number of compositions: 60 [2023-08-04 07:13:57,203 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 07:13:57,203 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;@597dd547, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:13:57,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 07:13:57,206 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:13:57,206 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-08-04 07:13:57,206 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:57,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:57,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 07:13:57,206 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 07:13:57,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash -56060982, now seen corresponding path program 1 times [2023-08-04 07:13:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:57,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684758709] [2023-08-04 07:13:57,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:57,229 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 07:13:57,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:57,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684758709] [2023-08-04 07:13:57,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684758709] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:13:57,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:13:57,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:13:57,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150376171] [2023-08-04 07:13:57,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:13:57,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:13:57,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:57,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:13:57,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:13:57,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 166 [2023-08-04 07:13:57,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:57,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:57,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 166 [2023-08-04 07:13:57,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:57,290 INFO L124 PetriNetUnfolderBase]: 160/340 cut-off events. [2023-08-04 07:13:57,291 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:57,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 340 events. 160/340 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1635 event pairs, 78 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 670. Up to 284 conditions per place. [2023-08-04 07:13:57,293 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 18 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-08-04 07:13:57,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 107 flow [2023-08-04 07:13:57,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:13:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:13:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2023-08-04 07:13:57,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6024096385542169 [2023-08-04 07:13:57,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 300 transitions. [2023-08-04 07:13:57,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 300 transitions. [2023-08-04 07:13:57,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:57,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 300 transitions. [2023-08-04 07:13:57,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:57,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:57,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:57,297 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 61 flow. Second operand 3 states and 300 transitions. [2023-08-04 07:13:57,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 107 flow [2023-08-04 07:13:57,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 107 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:13:57,298 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 69 flow [2023-08-04 07:13:57,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-08-04 07:13:57,301 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-08-04 07:13:57,301 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 69 flow [2023-08-04 07:13:57,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:57,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:57,302 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 07:13:57,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 07:13:57,302 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 07:13:57,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:57,303 INFO L85 PathProgramCache]: Analyzing trace with hash -64633540, now seen corresponding path program 1 times [2023-08-04 07:13:57,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:57,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200733020] [2023-08-04 07:13:57,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:57,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:13:57,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:13:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:13:57,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:13:57,347 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:13:57,348 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 07:13:57,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 07:13:57,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 07:13:57,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 07:13:57,348 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 07:13:57,349 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 07:13:57,350 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 07:13:57,350 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 07:13:57,376 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:13:57,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 290 flow [2023-08-04 07:13:57,490 INFO L124 PetriNetUnfolderBase]: 93/1304 cut-off events. [2023-08-04 07:13:57,490 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 07:13:57,494 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 07:13:57,494 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 290 flow [2023-08-04 07:13:57,497 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 112 transitions, 248 flow [2023-08-04 07:13:57,497 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:13:57,497 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 112 transitions, 248 flow [2023-08-04 07:13:57,497 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 112 transitions, 248 flow [2023-08-04 07:13:57,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 112 transitions, 248 flow [2023-08-04 07:13:57,564 INFO L124 PetriNetUnfolderBase]: 66/967 cut-off events. [2023-08-04 07:13:57,565 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-04 07:13:57,568 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 07:13:57,582 INFO L119 LiptonReduction]: Number of co-enabled transitions 3996 [2023-08-04 07:13:59,164 INFO L134 LiptonReduction]: Checked pairs total: 7661 [2023-08-04 07:13:59,164 INFO L136 LiptonReduction]: Total number of compositions: 79 [2023-08-04 07:13:59,165 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:13:59,166 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;@597dd547, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:13:59,166 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 07:13:59,168 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:13:59,168 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-04 07:13:59,168 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:13:59,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:59,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 07:13:59,168 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:59,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:59,169 INFO L85 PathProgramCache]: Analyzing trace with hash 630489879, now seen corresponding path program 1 times [2023-08-04 07:13:59,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:59,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559882242] [2023-08-04 07:13:59,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:59,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:59,196 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 07:13:59,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:59,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559882242] [2023-08-04 07:13:59,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559882242] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:13:59,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:13:59,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:13:59,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598163026] [2023-08-04 07:13:59,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:13:59,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:13:59,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:59,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:13:59,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:13:59,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 206 [2023-08-04 07:13:59,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:13:59,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:59,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 206 [2023-08-04 07:13:59,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:14:02,724 INFO L124 PetriNetUnfolderBase]: 33046/47771 cut-off events. [2023-08-04 07:14:02,725 INFO L125 PetriNetUnfolderBase]: For 1425/1425 co-relation queries the response was YES. [2023-08-04 07:14:02,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93162 conditions, 47771 events. 33046/47771 cut-off events. For 1425/1425 co-relation queries the response was YES. Maximal size of possible extension queue 1603. Compared 334227 event pairs, 26064 based on Foata normal form. 0/45433 useless extension candidates. Maximal degree in co-relation 26554. Up to 43520 conditions per place. [2023-08-04 07:14:03,018 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 31 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-04 07:14:03,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 174 flow [2023-08-04 07:14:03,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:14:03,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:14:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-04 07:14:03,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5938511326860841 [2023-08-04 07:14:03,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-04 07:14:03,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-04 07:14:03,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:14:03,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-04 07:14:03,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:03,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:03,024 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:03,024 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 100 flow. Second operand 3 states and 367 transitions. [2023-08-04 07:14:03,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 174 flow [2023-08-04 07:14:03,025 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 07:14:03,026 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 112 flow [2023-08-04 07:14:03,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, 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 07:14:03,028 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-04 07:14:03,028 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 112 flow [2023-08-04 07:14:03,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:03,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:14:03,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:14:03,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 07:14:03,029 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:14:03,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:14:03,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1300022750, now seen corresponding path program 1 times [2023-08-04 07:14:03,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:14:03,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851370971] [2023-08-04 07:14:03,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:03,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:14:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:03,070 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 07:14:03,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:14:03,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851370971] [2023-08-04 07:14:03,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851370971] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:14:03,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484721982] [2023-08-04 07:14:03,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:03,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:14:03,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:14:03,073 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 07:14:03,082 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 07:14:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:03,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:14:03,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:14:03,153 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 07:14:03,153 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:14:03,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484721982] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:14:03,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:14:03,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:14:03,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679271042] [2023-08-04 07:14:03,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:14:03,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:14:03,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:14:03,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:14:03,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:14:03,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 206 [2023-08-04 07:14:03,165 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 07:14:03,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:14:03,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 206 [2023-08-04 07:14:03,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:14:05,783 INFO L124 PetriNetUnfolderBase]: 31406/44873 cut-off events. [2023-08-04 07:14:05,783 INFO L125 PetriNetUnfolderBase]: For 1143/1143 co-relation queries the response was YES. [2023-08-04 07:14:05,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87754 conditions, 44873 events. 31406/44873 cut-off events. For 1143/1143 co-relation queries the response was YES. Maximal size of possible extension queue 1591. Compared 307521 event pairs, 24928 based on Foata normal form. 0/42784 useless extension candidates. Maximal degree in co-relation 87717. Up to 40987 conditions per place. [2023-08-04 07:14:06,044 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 36 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-04 07:14:06,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 204 flow [2023-08-04 07:14:06,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:14:06,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:14:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-08-04 07:14:06,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6003236245954693 [2023-08-04 07:14:06,046 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-08-04 07:14:06,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-08-04 07:14:06,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:14:06,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-08-04 07:14:06,047 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 07:14:06,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:06,049 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:06,049 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 112 flow. Second operand 3 states and 371 transitions. [2023-08-04 07:14:06,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 204 flow [2023-08-04 07:14:06,052 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 07:14:06,053 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 122 flow [2023-08-04 07:14:06,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, 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 07:14:06,054 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2023-08-04 07:14:06,054 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 122 flow [2023-08-04 07:14:06,054 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 07:14:06,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:14:06,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:14:06,060 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 07:14:06,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:14:06,259 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:14:06,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:14:06,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1982578291, now seen corresponding path program 1 times [2023-08-04 07:14:06,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:14:06,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268847294] [2023-08-04 07:14:06,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:06,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:14:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:06,305 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 07:14:06,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:14:06,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268847294] [2023-08-04 07:14:06,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268847294] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:14:06,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169435184] [2023-08-04 07:14:06,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:06,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:14:06,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:14:06,306 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 07:14:06,309 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 07:14:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:06,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:14:06,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:14:06,386 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 07:14:06,386 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:14:06,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169435184] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:14:06,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:14:06,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:14:06,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716969466] [2023-08-04 07:14:06,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:14:06,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:14:06,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:14:06,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:14:06,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:14:06,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 206 [2023-08-04 07:14:06,398 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 07:14:06,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:14:06,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 206 [2023-08-04 07:14:06,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:14:09,011 INFO L124 PetriNetUnfolderBase]: 30734/43358 cut-off events. [2023-08-04 07:14:09,012 INFO L125 PetriNetUnfolderBase]: For 833/833 co-relation queries the response was YES. [2023-08-04 07:14:09,089 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 07:14:09,219 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 41 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-04 07:14:09,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 232 flow [2023-08-04 07:14:09,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:14:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:14:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-04 07:14:09,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6067961165048543 [2023-08-04 07:14:09,221 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-04 07:14:09,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-04 07:14:09,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:14:09,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-04 07:14:09,222 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 07:14:09,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:09,224 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:09,224 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 122 flow. Second operand 3 states and 375 transitions. [2023-08-04 07:14:09,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 232 flow [2023-08-04 07:14:09,229 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 07:14:09,230 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 132 flow [2023-08-04 07:14:09,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, 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 07:14:09,231 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-04 07:14:09,231 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 132 flow [2023-08-04 07:14:09,231 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 07:14:09,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:14:09,232 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 07:14:09,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 07:14:09,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:14:09,441 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:14:09,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:14:09,442 INFO L85 PathProgramCache]: Analyzing trace with hash -832832190, now seen corresponding path program 1 times [2023-08-04 07:14:09,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:14:09,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414431026] [2023-08-04 07:14:09,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:09,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:14:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:09,476 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 07:14:09,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:14:09,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414431026] [2023-08-04 07:14:09,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414431026] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:14:09,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657239174] [2023-08-04 07:14:09,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:09,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:14:09,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:14:09,478 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 07:14:09,504 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 07:14:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:09,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:14:09,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:14:09,570 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 07:14:09,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:14:09,591 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 07:14:09,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657239174] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:14:09,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:14:09,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:14:09,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526384808] [2023-08-04 07:14:09,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:14:09,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:14:09,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:14:09,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:14:09,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:14:09,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 206 [2023-08-04 07:14:09,606 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 07:14:09,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:14:09,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 206 [2023-08-04 07:14:09,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:14:11,751 INFO L124 PetriNetUnfolderBase]: 24232/33893 cut-off events. [2023-08-04 07:14:11,752 INFO L125 PetriNetUnfolderBase]: For 3624/3624 co-relation queries the response was YES. [2023-08-04 07:14:11,826 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 07:14:11,936 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 36 selfloop transitions, 3 changer transitions 1/49 dead transitions. [2023-08-04 07:14:11,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 228 flow [2023-08-04 07:14:11,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:14:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:14:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-08-04 07:14:11,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5813106796116505 [2023-08-04 07:14:11,938 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-08-04 07:14:11,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-08-04 07:14:11,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:14:11,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-08-04 07:14:11,940 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 07:14:11,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:11,942 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:11,942 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 132 flow. Second operand 4 states and 479 transitions. [2023-08-04 07:14:11,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 228 flow [2023-08-04 07:14:11,947 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 07:14:11,948 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 144 flow [2023-08-04 07:14:11,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, 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 07:14:11,949 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-04 07:14:11,949 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 144 flow [2023-08-04 07:14:11,949 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 07:14:11,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:14:11,949 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 07:14:11,959 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 07:14:12,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:14:12,155 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:14:12,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:14:12,155 INFO L85 PathProgramCache]: Analyzing trace with hash -475613238, now seen corresponding path program 1 times [2023-08-04 07:14:12,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:14:12,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241034210] [2023-08-04 07:14:12,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:12,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:14:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:12,217 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 07:14:12,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:14:12,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241034210] [2023-08-04 07:14:12,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241034210] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:14:12,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273252933] [2023-08-04 07:14:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:12,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:14:12,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:14:12,219 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 07:14:12,251 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 07:14:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:12,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:14:12,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:14:12,317 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 07:14:12,317 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:14:12,328 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 07:14:12,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273252933] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:14:12,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:14:12,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 07:14:12,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656114487] [2023-08-04 07:14:12,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:14:12,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:14:12,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:14:12,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:14:12,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:14:12,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 206 [2023-08-04 07:14:12,341 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 07:14:12,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:14:12,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 206 [2023-08-04 07:14:12,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:14:13,973 INFO L124 PetriNetUnfolderBase]: 19198/26485 cut-off events. [2023-08-04 07:14:13,974 INFO L125 PetriNetUnfolderBase]: For 2439/2439 co-relation queries the response was YES. [2023-08-04 07:14:14,013 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 07:14:14,096 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 44 selfloop transitions, 3 changer transitions 1/57 dead transitions. [2023-08-04 07:14:14,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 272 flow [2023-08-04 07:14:14,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:14:14,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:14:14,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-08-04 07:14:14,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5910194174757282 [2023-08-04 07:14:14,099 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-08-04 07:14:14,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-08-04 07:14:14,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:14:14,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-08-04 07:14:14,101 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 07:14:14,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:14,103 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:14,103 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 144 flow. Second operand 4 states and 487 transitions. [2023-08-04 07:14:14,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 272 flow [2023-08-04 07:14:14,107 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 07:14:14,110 INFO L231 Difference]: Finished difference. Result has 64 places, 41 transitions, 151 flow [2023-08-04 07:14:14,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, 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 07:14:14,111 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2023-08-04 07:14:14,111 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 41 transitions, 151 flow [2023-08-04 07:14:14,111 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 07:14:14,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:14:14,111 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 07:14:14,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-04 07:14:14,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:14:14,319 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:14:14,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:14:14,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1718929282, now seen corresponding path program 1 times [2023-08-04 07:14:14,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:14:14,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7585564] [2023-08-04 07:14:14,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:14,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:14:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:14,379 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 07:14:14,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:14:14,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7585564] [2023-08-04 07:14:14,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7585564] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:14:14,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961699388] [2023-08-04 07:14:14,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:14,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:14:14,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:14:14,381 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 07:14:14,383 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 07:14:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:14,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:14:14,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:14:14,487 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 07:14:14,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:14:14,500 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 07:14:14,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961699388] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:14:14,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:14:14,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 07:14:14,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212778408] [2023-08-04 07:14:14,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:14:14,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:14:14,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:14:14,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:14:14,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:14:14,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 206 [2023-08-04 07:14:14,514 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 07:14:14,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:14:14,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 206 [2023-08-04 07:14:14,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:14:16,046 INFO L124 PetriNetUnfolderBase]: 17362/23209 cut-off events. [2023-08-04 07:14:16,047 INFO L125 PetriNetUnfolderBase]: For 2377/2377 co-relation queries the response was YES. [2023-08-04 07:14:16,078 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 07:14:16,124 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 52 selfloop transitions, 3 changer transitions 1/65 dead transitions. [2023-08-04 07:14:16,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 311 flow [2023-08-04 07:14:16,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:14:16,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:14:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2023-08-04 07:14:16,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6007281553398058 [2023-08-04 07:14:16,127 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 495 transitions. [2023-08-04 07:14:16,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 495 transitions. [2023-08-04 07:14:16,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:14:16,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 495 transitions. [2023-08-04 07:14:16,128 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 07:14:16,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:16,130 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:16,130 INFO L175 Difference]: Start difference. First operand has 64 places, 41 transitions, 151 flow. Second operand 4 states and 495 transitions. [2023-08-04 07:14:16,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 311 flow [2023-08-04 07:14:16,133 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 07:14:16,134 INFO L231 Difference]: Finished difference. Result has 66 places, 41 transitions, 158 flow [2023-08-04 07:14:16,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, 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 07:14:16,134 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2023-08-04 07:14:16,134 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 41 transitions, 158 flow [2023-08-04 07:14:16,135 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 07:14:16,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:14:16,135 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 07:14:16,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-04 07:14:16,339 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,SelfDestructingSolverStorable11 [2023-08-04 07:14:16,339 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:14:16,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:14:16,340 INFO L85 PathProgramCache]: Analyzing trace with hash -501771954, now seen corresponding path program 1 times [2023-08-04 07:14:16,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:14:16,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256525721] [2023-08-04 07:14:16,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:16,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:14:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:16,494 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 07:14:16,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:14:16,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256525721] [2023-08-04 07:14:16,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256525721] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:14:16,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:14:16,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 07:14:16,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076265096] [2023-08-04 07:14:16,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:14:16,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:14:16,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:14:16,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:14:16,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:14:16,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 206 [2023-08-04 07:14:16,514 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 07:14:16,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:14:16,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 206 [2023-08-04 07:14:16,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:14:22,997 INFO L124 PetriNetUnfolderBase]: 84670/111137 cut-off events. [2023-08-04 07:14:22,997 INFO L125 PetriNetUnfolderBase]: For 52065/52065 co-relation queries the response was YES. [2023-08-04 07:14:23,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249817 conditions, 111137 events. 84670/111137 cut-off events. For 52065/52065 co-relation queries the response was YES. Maximal size of possible extension queue 4165. Compared 687617 event pairs, 34623 based on Foata normal form. 2269/113330 useless extension candidates. Maximal degree in co-relation 68379. Up to 57445 conditions per place. [2023-08-04 07:14:23,890 INFO L140 encePairwiseOnDemand]: 194/206 looper letters, 52 selfloop transitions, 11 changer transitions 0/68 dead transitions. [2023-08-04 07:14:23,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 68 transitions, 385 flow [2023-08-04 07:14:23,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:14:23,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:14:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-04 07:14:23,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5857605177993528 [2023-08-04 07:14:23,892 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-04 07:14:23,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-04 07:14:23,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:14:23,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-04 07:14:23,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:23,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:23,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:23,895 INFO L175 Difference]: Start difference. First operand has 66 places, 41 transitions, 158 flow. Second operand 3 states and 362 transitions. [2023-08-04 07:14:23,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 68 transitions, 385 flow [2023-08-04 07:14:24,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 68 transitions, 371 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 07:14:24,007 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 237 flow [2023-08-04 07:14:24,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, 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 07:14:24,008 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2023-08-04 07:14:24,008 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 237 flow [2023-08-04 07:14:24,008 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 07:14:24,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:14:24,008 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 07:14:24,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-04 07:14:24,009 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:14:24,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:14:24,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1624937004, now seen corresponding path program 1 times [2023-08-04 07:14:24,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:14:24,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904915632] [2023-08-04 07:14:24,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:24,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:14:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:24,135 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 07:14:24,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:14:24,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904915632] [2023-08-04 07:14:24,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904915632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:14:24,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:14:24,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:14:24,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253131985] [2023-08-04 07:14:24,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:14:24,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 07:14:24,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:14:24,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 07:14:24,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 07:14:24,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 206 [2023-08-04 07:14:24,161 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 07:14:24,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:14:24,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 206 [2023-08-04 07:14:24,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:14:31,005 INFO L124 PetriNetUnfolderBase]: 83616/108388 cut-off events. [2023-08-04 07:14:31,005 INFO L125 PetriNetUnfolderBase]: For 79389/79389 co-relation queries the response was YES. [2023-08-04 07:14:31,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320803 conditions, 108388 events. 83616/108388 cut-off events. For 79389/79389 co-relation queries the response was YES. Maximal size of possible extension queue 4013. Compared 654597 event pairs, 8443 based on Foata normal form. 128/108440 useless extension candidates. Maximal degree in co-relation 91027. Up to 50980 conditions per place. [2023-08-04 07:14:31,664 INFO L140 encePairwiseOnDemand]: 194/206 looper letters, 67 selfloop transitions, 15 changer transitions 0/87 dead transitions. [2023-08-04 07:14:31,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 87 transitions, 555 flow [2023-08-04 07:14:31,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:14:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:14:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 474 transitions. [2023-08-04 07:14:31,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5752427184466019 [2023-08-04 07:14:31,666 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 474 transitions. [2023-08-04 07:14:31,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 474 transitions. [2023-08-04 07:14:31,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:14:31,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 474 transitions. [2023-08-04 07:14:31,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:31,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:31,669 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:31,670 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 237 flow. Second operand 4 states and 474 transitions. [2023-08-04 07:14:31,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 87 transitions, 555 flow [2023-08-04 07:14:31,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 87 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:14:31,874 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 333 flow [2023-08-04 07:14:31,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, 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 07:14:31,874 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-08-04 07:14:31,875 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 333 flow [2023-08-04 07:14:31,875 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 07:14:31,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:14:31,875 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 07:14:31,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-04 07:14:31,875 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:14:31,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:14:31,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1624937965, now seen corresponding path program 1 times [2023-08-04 07:14:31,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:14:31,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557972560] [2023-08-04 07:14:31,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:31,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:14:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:31,989 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 07:14:31,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:14:31,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557972560] [2023-08-04 07:14:31,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557972560] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:14:31,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:14:31,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:14:31,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653636828] [2023-08-04 07:14:31,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:14:31,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 07:14:31,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:14:31,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 07:14:31,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 07:14:32,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 206 [2023-08-04 07:14:32,009 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.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 07:14:32,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:14:32,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 206 [2023-08-04 07:14:32,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:14:38,754 INFO L124 PetriNetUnfolderBase]: 83494/108167 cut-off events. [2023-08-04 07:14:38,755 INFO L125 PetriNetUnfolderBase]: For 118032/118032 co-relation queries the response was YES. [2023-08-04 07:14:39,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353206 conditions, 108167 events. 83494/108167 cut-off events. For 118032/118032 co-relation queries the response was YES. Maximal size of possible extension queue 4005. Compared 658143 event pairs, 18282 based on Foata normal form. 7/108092 useless extension candidates. Maximal degree in co-relation 353104. Up to 56855 conditions per place. [2023-08-04 07:14:39,947 INFO L140 encePairwiseOnDemand]: 194/206 looper letters, 83 selfloop transitions, 29 changer transitions 0/117 dead transitions. [2023-08-04 07:14:39,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 117 transitions, 860 flow [2023-08-04 07:14:39,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:14:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:14:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-08-04 07:14:39,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5910194174757282 [2023-08-04 07:14:39,950 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-08-04 07:14:39,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-08-04 07:14:39,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:14:39,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-08-04 07:14:39,951 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 07:14:39,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:39,953 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:39,953 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 333 flow. Second operand 4 states and 487 transitions. [2023-08-04 07:14:39,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 117 transitions, 860 flow [2023-08-04 07:14:40,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 117 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:14:40,186 INFO L231 Difference]: Finished difference. Result has 77 places, 77 transitions, 579 flow [2023-08-04 07:14:40,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, 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=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=579, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2023-08-04 07:14:40,187 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2023-08-04 07:14:40,187 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 579 flow [2023-08-04 07:14:40,187 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 07:14:40,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:14:40,187 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 07:14:40,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 07:14:40,188 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:14:40,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:14:40,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1166528399, now seen corresponding path program 1 times [2023-08-04 07:14:40,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:14:40,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793961073] [2023-08-04 07:14:40,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:40,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:14:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:40,359 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 07:14:40,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:14:40,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793961073] [2023-08-04 07:14:40,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793961073] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:14:40,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:14:40,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 07:14:40,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494175423] [2023-08-04 07:14:40,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:14:40,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 07:14:40,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:14:40,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 07:14:40,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 07:14:40,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 206 [2023-08-04 07:14:40,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 579 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 07:14:40,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:14:40,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 206 [2023-08-04 07:14:40,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:14:52,236 INFO L124 PetriNetUnfolderBase]: 127629/164529 cut-off events. [2023-08-04 07:14:52,236 INFO L125 PetriNetUnfolderBase]: For 479096/479096 co-relation queries the response was YES. [2023-08-04 07:14:53,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637508 conditions, 164529 events. 127629/164529 cut-off events. For 479096/479096 co-relation queries the response was YES. Maximal size of possible extension queue 6382. Compared 1030823 event pairs, 25697 based on Foata normal form. 945/165439 useless extension candidates. Maximal degree in co-relation 637395. Up to 69333 conditions per place. [2023-08-04 07:14:53,657 INFO L140 encePairwiseOnDemand]: 194/206 looper letters, 95 selfloop transitions, 41 changer transitions 0/141 dead transitions. [2023-08-04 07:14:53,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 141 transitions, 1250 flow [2023-08-04 07:14:53,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:14:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:14:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2023-08-04 07:14:53,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5983009708737864 [2023-08-04 07:14:53,659 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 493 transitions. [2023-08-04 07:14:53,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 493 transitions. [2023-08-04 07:14:53,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:14:53,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 493 transitions. [2023-08-04 07:14:53,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:53,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:53,662 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:53,662 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 579 flow. Second operand 4 states and 493 transitions. [2023-08-04 07:14:53,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 141 transitions, 1250 flow [2023-08-04 07:14:54,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 141 transitions, 1250 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:14:54,616 INFO L231 Difference]: Finished difference. Result has 83 places, 95 transitions, 961 flow [2023-08-04 07:14:54,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=961, PETRI_PLACES=83, PETRI_TRANSITIONS=95} [2023-08-04 07:14:54,617 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2023-08-04 07:14:54,617 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 95 transitions, 961 flow [2023-08-04 07:14:54,617 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 07:14:54,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:14:54,617 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 07:14:54,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 07:14:54,618 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:14:54,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:14:54,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2092544877, now seen corresponding path program 1 times [2023-08-04 07:14:54,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:14:54,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280232896] [2023-08-04 07:14:54,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:54,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:14:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:54,748 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 07:14:54,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:14:54,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280232896] [2023-08-04 07:14:54,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280232896] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:14:54,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659329551] [2023-08-04 07:14:54,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:54,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:14:54,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:14:54,750 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 07:14:54,753 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 07:14:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:54,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-04 07:14:54,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:14:54,890 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 07:14:54,890 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:14:54,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659329551] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:14:54,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:14:54,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2023-08-04 07:14:54,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31924446] [2023-08-04 07:14:54,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:14:54,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:14:54,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:14:54,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:14:54,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:14:54,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 206 [2023-08-04 07:14:54,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 95 transitions, 961 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 07:14:54,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:14:54,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 206 [2023-08-04 07:14:54,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:15:00,941 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([593] $Ultimate##0-->L758: Formula: (and (= v_~x~0_32 v_~__unbuffered_p2_EAX~0_34) (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][150], [P2Thread2of2ForFork2InUse, 111#L758true, 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), 615#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 609#(= ~__unbuffered_p2_EAX~0 0), 16#$Ultimate##0true, 631#true, 117#P1EXITtrue, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 17#L761true, Black: 623#true, Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 625#(= ~y~0 1), P2Thread1of2ForFork2InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 07:15:00,941 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 07:15:00,941 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 07:15:00,941 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 07:15:00,941 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 07:15:00,942 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([562] $Ultimate##0-->L743: Formula: (and (= |v_P1Thread2of2ForFork1_#in~arg.offset_5| v_P1Thread2of2ForFork1_~arg.offset_5) (= v_~y~0_43 2) (= v_P1Thread2of2ForFork1_~arg.base_5 |v_P1Thread2of2ForFork1_#in~arg.base_5|)) InVars {P1Thread2of2ForFork1_#in~arg.offset=|v_P1Thread2of2ForFork1_#in~arg.offset_5|, P1Thread2of2ForFork1_#in~arg.base=|v_P1Thread2of2ForFork1_#in~arg.base_5|} OutVars{P1Thread2of2ForFork1_#in~arg.offset=|v_P1Thread2of2ForFork1_#in~arg.offset_5|, P1Thread2of2ForFork1_~arg.offset=v_P1Thread2of2ForFork1_~arg.offset_5, P1Thread2of2ForFork1_#in~arg.base=|v_P1Thread2of2ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_43, P1Thread2of2ForFork1_~arg.base=v_P1Thread2of2ForFork1_~arg.base_5} AuxVars[] AssignedVars[P1Thread2of2ForFork1_~arg.offset, ~y~0, P1Thread2of2ForFork1_~arg.base][116], [P2Thread2of2ForFork2InUse, 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), 615#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 98#$Ultimate##0true, Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, 623#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 59#L743true, Black: 609#(= ~__unbuffered_p2_EAX~0 0), 631#true, 117#P1EXITtrue, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 17#L761true, Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 625#(= ~y~0 1), P2Thread1of2ForFork2InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 07:15:00,942 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 07:15:00,942 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 07:15:00,942 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 07:15:00,942 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 07:15:00,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] $Ultimate##0-->L743: Formula: (and (= v_~y~0_41 2) (= v_P1Thread1of2ForFork1_~arg.base_5 |v_P1Thread1of2ForFork1_#in~arg.base_5|) (= |v_P1Thread1of2ForFork1_#in~arg.offset_5| v_P1Thread1of2ForFork1_~arg.offset_5)) InVars {P1Thread1of2ForFork1_#in~arg.offset=|v_P1Thread1of2ForFork1_#in~arg.offset_5|, P1Thread1of2ForFork1_#in~arg.base=|v_P1Thread1of2ForFork1_#in~arg.base_5|} OutVars{P1Thread1of2ForFork1_#in~arg.offset=|v_P1Thread1of2ForFork1_#in~arg.offset_5|, P1Thread1of2ForFork1_~arg.offset=v_P1Thread1of2ForFork1_~arg.offset_5, ~y~0=v_~y~0_41, P1Thread1of2ForFork1_#in~arg.base=|v_P1Thread1of2ForFork1_#in~arg.base_5|, P1Thread1of2ForFork1_~arg.base=v_P1Thread1of2ForFork1_~arg.base_5} AuxVars[] AssignedVars[P1Thread1of2ForFork1_~arg.offset, ~y~0, P1Thread1of2ForFork1_~arg.base][115], [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), 615#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 98#$Ultimate##0true, Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, 623#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 609#(= ~__unbuffered_p2_EAX~0 0), 631#true, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 17#L761true, Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 625#(= ~y~0 1), P2Thread1of2ForFork2InUse, 89#L743true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 07:15:00,943 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 07:15:00,943 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 07:15:00,943 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 07:15:00,943 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 07:15:00,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([593] $Ultimate##0-->L758: Formula: (and (= v_~x~0_32 v_~__unbuffered_p2_EAX~0_34) (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][150], [P2Thread2of2ForFork2InUse, 113#P1EXITtrue, 111#L758true, 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), 615#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 609#(= ~__unbuffered_p2_EAX~0 0), 631#true, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 17#L761true, 4#$Ultimate##0true, Black: 623#true, Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 625#(= ~y~0 1), P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 07:15:00,943 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 07:15:00,943 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 07:15:00,943 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 07:15:00,943 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 07:15:01,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([562] $Ultimate##0-->L743: Formula: (and (= |v_P1Thread2of2ForFork1_#in~arg.offset_5| v_P1Thread2of2ForFork1_~arg.offset_5) (= v_~y~0_43 2) (= v_P1Thread2of2ForFork1_~arg.base_5 |v_P1Thread2of2ForFork1_#in~arg.base_5|)) InVars {P1Thread2of2ForFork1_#in~arg.offset=|v_P1Thread2of2ForFork1_#in~arg.offset_5|, P1Thread2of2ForFork1_#in~arg.base=|v_P1Thread2of2ForFork1_#in~arg.base_5|} OutVars{P1Thread2of2ForFork1_#in~arg.offset=|v_P1Thread2of2ForFork1_#in~arg.offset_5|, P1Thread2of2ForFork1_~arg.offset=v_P1Thread2of2ForFork1_~arg.offset_5, P1Thread2of2ForFork1_#in~arg.base=|v_P1Thread2of2ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_43, P1Thread2of2ForFork1_~arg.base=v_P1Thread2of2ForFork1_~arg.base_5} AuxVars[] AssignedVars[P1Thread2of2ForFork1_~arg.offset, ~y~0, P1Thread2of2ForFork1_~arg.base][116], [P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 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_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, 623#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 59#L743true, Black: 609#(= ~__unbuffered_p2_EAX~0 0), 631#true, 117#P1EXITtrue, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 17#L761true, Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 625#(= ~y~0 1), 64#L790true, P2Thread1of2ForFork2InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 07:15:01,010 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 07:15:01,010 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:01,010 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:01,010 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:01,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] $Ultimate##0-->L743: Formula: (and (= v_~y~0_41 2) (= v_P1Thread1of2ForFork1_~arg.base_5 |v_P1Thread1of2ForFork1_#in~arg.base_5|) (= |v_P1Thread1of2ForFork1_#in~arg.offset_5| v_P1Thread1of2ForFork1_~arg.offset_5)) InVars {P1Thread1of2ForFork1_#in~arg.offset=|v_P1Thread1of2ForFork1_#in~arg.offset_5|, P1Thread1of2ForFork1_#in~arg.base=|v_P1Thread1of2ForFork1_#in~arg.base_5|} OutVars{P1Thread1of2ForFork1_#in~arg.offset=|v_P1Thread1of2ForFork1_#in~arg.offset_5|, P1Thread1of2ForFork1_~arg.offset=v_P1Thread1of2ForFork1_~arg.offset_5, ~y~0=v_~y~0_41, P1Thread1of2ForFork1_#in~arg.base=|v_P1Thread1of2ForFork1_#in~arg.base_5|, P1Thread1of2ForFork1_~arg.base=v_P1Thread1of2ForFork1_~arg.base_5} AuxVars[] AssignedVars[P1Thread1of2ForFork1_~arg.offset, ~y~0, P1Thread1of2ForFork1_~arg.base][115], [P2Thread2of2ForFork2InUse, 113#P1EXITtrue, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 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_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, 623#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 609#(= ~__unbuffered_p2_EAX~0 0), 631#true, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 17#L761true, Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 625#(= ~y~0 1), 64#L790true, P2Thread1of2ForFork2InUse, 89#L743true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 07:15:01,035 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 07:15:01,035 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:01,035 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:01,035 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:01,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([593] $Ultimate##0-->L758: Formula: (and (= v_~x~0_32 v_~__unbuffered_p2_EAX~0_34) (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][150], [P2Thread2of2ForFork2InUse, 111#L758true, P0Thread1of2ForFork0InUse, 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), 615#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 609#(= ~__unbuffered_p2_EAX~0 0), 16#$Ultimate##0true, 631#true, 117#P1EXITtrue, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 17#L761true, Black: 623#true, Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 625#(= ~y~0 1), 64#L790true, P2Thread1of2ForFork2InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 07:15:01,510 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 07:15:01,510 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:01,510 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:01,511 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:01,521 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([593] $Ultimate##0-->L758: Formula: (and (= v_~x~0_32 v_~__unbuffered_p2_EAX~0_34) (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][150], [P2Thread2of2ForFork2InUse, 111#L758true, 113#P1EXITtrue, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 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_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 609#(= ~__unbuffered_p2_EAX~0 0), 631#true, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 17#L761true, 4#$Ultimate##0true, Black: 623#true, Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 625#(= ~y~0 1), 64#L790true, P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 07:15:01,521 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 07:15:01,521 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:01,521 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:01,522 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:02,126 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([593] $Ultimate##0-->L758: Formula: (and (= v_~x~0_32 v_~__unbuffered_p2_EAX~0_34) (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][150], [P2Thread2of2ForFork2InUse, 111#L758true, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 2#L785-11true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 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_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 609#(= ~__unbuffered_p2_EAX~0 0), 59#L743true, 631#true, 117#P1EXITtrue, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 17#L761true, Black: 623#true, Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 625#(= ~y~0 1), P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 07:15:02,127 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 07:15:02,127 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:02,127 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:02,127 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:02,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([593] $Ultimate##0-->L758: Formula: (and (= v_~x~0_32 v_~__unbuffered_p2_EAX~0_34) (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][150], [P2Thread2of2ForFork2InUse, 113#P1EXITtrue, 111#L758true, 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), 615#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 609#(= ~__unbuffered_p2_EAX~0 0), 631#true, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 17#L761true, Black: 623#true, Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 625#(= ~y~0 1), P2Thread1of2ForFork2InUse, 89#L743true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 07:15:02,128 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 07:15:02,128 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:02,128 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:02,128 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 07:15:02,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([593] $Ultimate##0-->L758: Formula: (and (= v_~x~0_32 v_~__unbuffered_p2_EAX~0_34) (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][150], [P2Thread2of2ForFork2InUse, 111#L758true, P0Thread1of2ForFork0InUse, 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), 615#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 59#L743true, Black: 609#(= ~__unbuffered_p2_EAX~0 0), 631#true, 117#P1EXITtrue, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 17#L761true, Black: 623#true, Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 625#(= ~y~0 1), 64#L790true, P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 07:15:02,633 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 07:15:02,633 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 07:15:02,633 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 07:15:02,634 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 07:15:02,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([593] $Ultimate##0-->L758: Formula: (and (= v_~x~0_32 v_~__unbuffered_p2_EAX~0_34) (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][150], [P2Thread2of2ForFork2InUse, 111#L758true, 113#P1EXITtrue, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 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_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 609#(= ~__unbuffered_p2_EAX~0 0), 631#true, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 17#L761true, Black: 623#true, Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 625#(= ~y~0 1), 64#L790true, P2Thread1of2ForFork2InUse, 89#L743true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 07:15:02,636 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 07:15:02,637 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 07:15:02,637 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 07:15:02,637 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 07:15:02,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([593] $Ultimate##0-->L758: Formula: (and (= v_~x~0_32 v_~__unbuffered_p2_EAX~0_34) (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][150], [P2Thread2of2ForFork2InUse, 113#P1EXITtrue, 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|), 15#L731true, 615#true, Black: 449#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, 83#P2EXITtrue, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 609#(= ~__unbuffered_p2_EAX~0 0), 631#true, 117#P1EXITtrue, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 623#true, Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 625#(= ~y~0 1), 35#L785-6true, P2Thread1of2ForFork2InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 07:15:02,641 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 07:15:02,641 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 07:15:02,641 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 07:15:02,641 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 07:15:03,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([593] $Ultimate##0-->L758: Formula: (and (= v_~x~0_32 v_~__unbuffered_p2_EAX~0_34) (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][150], [P2Thread2of2ForFork2InUse, 113#P1EXITtrue, 111#L758true, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 2#L785-11true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 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_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 609#(= ~__unbuffered_p2_EAX~0 0), 631#true, 117#P1EXITtrue, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 17#L761true, Black: 623#true, Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 625#(= ~y~0 1), P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 07:15:03,238 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-04 07:15:03,238 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 07:15:03,238 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 07:15:03,238 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 07:15:03,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([593] $Ultimate##0-->L758: Formula: (and (= v_~x~0_32 v_~__unbuffered_p2_EAX~0_34) (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][150], [P2Thread2of2ForFork2InUse, 111#L758true, 113#P1EXITtrue, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 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_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 609#(= ~__unbuffered_p2_EAX~0 0), 631#true, 117#P1EXITtrue, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 17#L761true, Black: 623#true, Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 625#(= ~y~0 1), 64#L790true, P2Thread1of2ForFork2InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 07:15:03,818 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-04 07:15:03,818 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 07:15:03,819 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 07:15:03,819 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 07:15:04,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([593] $Ultimate##0-->L758: Formula: (and (= v_~x~0_32 v_~__unbuffered_p2_EAX~0_34) (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][150], [P2Thread2of2ForFork2InUse, 113#P1EXITtrue, 111#L758true, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 2#L785-11true, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 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_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, 83#P2EXITtrue, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 609#(= ~__unbuffered_p2_EAX~0 0), 631#true, 117#P1EXITtrue, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 623#true, Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 625#(= ~y~0 1), P2Thread1of2ForFork2InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 07:15:04,096 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-04 07:15:04,096 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 07:15:04,096 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 07:15:04,096 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 07:15:04,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([562] $Ultimate##0-->L743: Formula: (and (= |v_P1Thread2of2ForFork1_#in~arg.offset_5| v_P1Thread2of2ForFork1_~arg.offset_5) (= v_~y~0_43 2) (= v_P1Thread2of2ForFork1_~arg.base_5 |v_P1Thread2of2ForFork1_#in~arg.base_5|)) InVars {P1Thread2of2ForFork1_#in~arg.offset=|v_P1Thread2of2ForFork1_#in~arg.offset_5|, P1Thread2of2ForFork1_#in~arg.base=|v_P1Thread2of2ForFork1_#in~arg.base_5|} OutVars{P1Thread2of2ForFork1_#in~arg.offset=|v_P1Thread2of2ForFork1_#in~arg.offset_5|, P1Thread2of2ForFork1_~arg.offset=v_P1Thread2of2ForFork1_~arg.offset_5, P1Thread2of2ForFork1_#in~arg.base=|v_P1Thread2of2ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_43, P1Thread2of2ForFork1_~arg.base=v_P1Thread2of2ForFork1_~arg.base_5} AuxVars[] AssignedVars[P1Thread2of2ForFork1_~arg.offset, ~y~0, P1Thread2of2ForFork1_~arg.base][116], [P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, P1Thread1of2ForFork1InUse, P1Thread2of2ForFork1InUse, 66#L731true, Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 15#L731true, 615#true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 48#L761true, Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, 623#true, 83#P2EXITtrue, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 59#L743true, Black: 609#(= ~__unbuffered_p2_EAX~0 0), 631#true, 117#P1EXITtrue, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 625#(= ~y~0 1), 64#L790true, P2Thread1of2ForFork2InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 07:15:04,501 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-04 07:15:04,501 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 07:15:04,501 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 07:15:04,501 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 07:15:04,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] $Ultimate##0-->L743: Formula: (and (= v_~y~0_41 2) (= v_P1Thread1of2ForFork1_~arg.base_5 |v_P1Thread1of2ForFork1_#in~arg.base_5|) (= |v_P1Thread1of2ForFork1_#in~arg.offset_5| v_P1Thread1of2ForFork1_~arg.offset_5)) InVars {P1Thread1of2ForFork1_#in~arg.offset=|v_P1Thread1of2ForFork1_#in~arg.offset_5|, P1Thread1of2ForFork1_#in~arg.base=|v_P1Thread1of2ForFork1_#in~arg.base_5|} OutVars{P1Thread1of2ForFork1_#in~arg.offset=|v_P1Thread1of2ForFork1_#in~arg.offset_5|, P1Thread1of2ForFork1_~arg.offset=v_P1Thread1of2ForFork1_~arg.offset_5, ~y~0=v_~y~0_41, P1Thread1of2ForFork1_#in~arg.base=|v_P1Thread1of2ForFork1_#in~arg.base_5|, P1Thread1of2ForFork1_~arg.base=v_P1Thread1of2ForFork1_~arg.base_5} AuxVars[] AssignedVars[P1Thread1of2ForFork1_~arg.offset, ~y~0, P1Thread1of2ForFork1_~arg.base][115], [P2Thread2of2ForFork2InUse, 113#P1EXITtrue, P0Thread1of2ForFork0InUse, 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), 615#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 48#L761true, Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, 623#true, 83#P2EXITtrue, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 609#(= ~__unbuffered_p2_EAX~0 0), 631#true, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 625#(= ~y~0 1), 64#L790true, P2Thread1of2ForFork2InUse, 89#L743true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 07:15:04,502 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-04 07:15:04,502 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 07:15:04,502 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 07:15:04,502 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 07:15:04,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([593] $Ultimate##0-->L758: Formula: (and (= v_~x~0_32 v_~__unbuffered_p2_EAX~0_34) (= v_P2Thread2of2ForFork2_~arg.base_5 |v_P2Thread2of2ForFork2_#in~arg.base_5|) (= |v_P2Thread2of2ForFork2_#in~arg.offset_5| v_P2Thread2of2ForFork2_~arg.offset_5)) InVars {P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32} OutVars{P2Thread2of2ForFork2_#in~arg.base=|v_P2Thread2of2ForFork2_#in~arg.base_5|, P2Thread2of2ForFork2_~arg.base=v_P2Thread2of2ForFork2_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, P2Thread2of2ForFork2_#in~arg.offset=|v_P2Thread2of2ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_32, P2Thread2of2ForFork2_~arg.offset=v_P2Thread2of2ForFork2_~arg.offset_5} AuxVars[] AssignedVars[P2Thread2of2ForFork2_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread2of2ForFork2_~arg.offset][150], [P2Thread2of2ForFork2InUse, 113#P1EXITtrue, 111#L758true, P0Thread1of2ForFork0InUse, 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), 615#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 603#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 607#true, 83#P2EXITtrue, Black: 610#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 609#(= ~__unbuffered_p2_EAX~0 0), 631#true, 117#P1EXITtrue, Black: 617#(= ~y~0 0), Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 618#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 623#true, Black: 626#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 625#(= ~y~0 1), 64#L790true, P2Thread1of2ForFork2InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 07:15:04,718 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-04 07:15:04,718 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 07:15:04,718 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 07:15:04,718 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 07:15:04,998 INFO L124 PetriNetUnfolderBase]: 91265/119709 cut-off events. [2023-08-04 07:15:04,998 INFO L125 PetriNetUnfolderBase]: For 868136/890085 co-relation queries the response was YES. [2023-08-04 07:15:05,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537865 conditions, 119709 events. 91265/119709 cut-off events. For 868136/890085 co-relation queries the response was YES. Maximal size of possible extension queue 5247. Compared 767347 event pairs, 16618 based on Foata normal form. 2355/111904 useless extension candidates. Maximal degree in co-relation 286775. Up to 104014 conditions per place. [2023-08-04 07:15:06,107 INFO L140 encePairwiseOnDemand]: 198/206 looper letters, 133 selfloop transitions, 7 changer transitions 0/161 dead transitions. [2023-08-04 07:15:06,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 161 transitions, 1904 flow [2023-08-04 07:15:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:15:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:15:06,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-08-04 07:15:06,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6132686084142395 [2023-08-04 07:15:06,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-08-04 07:15:06,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-08-04 07:15:06,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:15:06,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-08-04 07:15:06,110 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 07:15:06,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:15:06,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:15:06,111 INFO L175 Difference]: Start difference. First operand has 83 places, 95 transitions, 961 flow. Second operand 3 states and 379 transitions. [2023-08-04 07:15:06,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 161 transitions, 1904 flow [2023-08-04 07:15:06,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 161 transitions, 1904 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:15:06,748 INFO L231 Difference]: Finished difference. Result has 86 places, 101 transitions, 1008 flow [2023-08-04 07:15:06,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1008, PETRI_PLACES=86, PETRI_TRANSITIONS=101} [2023-08-04 07:15:06,748 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 35 predicate places. [2023-08-04 07:15:06,748 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 101 transitions, 1008 flow [2023-08-04 07:15:06,749 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 07:15:06,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:15:06,749 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 07:15:06,754 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 07:15:06,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-04 07:15:06,953 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:15:06,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:15:06,954 INFO L85 PathProgramCache]: Analyzing trace with hash -791126089, now seen corresponding path program 1 times [2023-08-04 07:15:06,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:15:06,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199206993] [2023-08-04 07:15:06,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:15:06,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:15:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:15:07,059 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 07:15:07,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:15:07,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199206993] [2023-08-04 07:15:07,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199206993] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:15:07,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:15:07,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 07:15:07,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779899390] [2023-08-04 07:15:07,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:15:07,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:15:07,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:15:07,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:15:07,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:15:07,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 206 [2023-08-04 07:15:07,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 101 transitions, 1008 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:15:07,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:15:07,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 206 [2023-08-04 07:15:07,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:15:18,931 INFO L124 PetriNetUnfolderBase]: 104714/136797 cut-off events. [2023-08-04 07:15:18,932 INFO L125 PetriNetUnfolderBase]: For 819454/822606 co-relation queries the response was YES. [2023-08-04 07:15:19,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668289 conditions, 136797 events. 104714/136797 cut-off events. For 819454/822606 co-relation queries the response was YES. Maximal size of possible extension queue 5188. Compared 869945 event pairs, 25891 based on Foata normal form. 1824/136673 useless extension candidates. Maximal degree in co-relation 397357. Up to 107794 conditions per place. [2023-08-04 07:15:20,168 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 142 selfloop transitions, 9 changer transitions 0/164 dead transitions. [2023-08-04 07:15:20,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 164 transitions, 1909 flow [2023-08-04 07:15:20,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:15:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:15:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-08-04 07:15:20,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6375404530744336 [2023-08-04 07:15:20,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-08-04 07:15:20,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-08-04 07:15:20,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:15:20,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-08-04 07:15:20,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:15:20,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:15:20,172 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:15:20,172 INFO L175 Difference]: Start difference. First operand has 86 places, 101 transitions, 1008 flow. Second operand 3 states and 394 transitions. [2023-08-04 07:15:20,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 164 transitions, 1909 flow [2023-08-04 07:15:21,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 164 transitions, 1898 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:15:21,379 INFO L231 Difference]: Finished difference. Result has 88 places, 109 transitions, 1142 flow [2023-08-04 07:15:21,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=88, PETRI_TRANSITIONS=109} [2023-08-04 07:15:21,380 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 37 predicate places. [2023-08-04 07:15:21,380 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 109 transitions, 1142 flow [2023-08-04 07:15:21,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:15:21,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:15:21,381 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:15:21,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-04 07:15:21,381 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:15:21,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:15:21,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1983305929, now seen corresponding path program 1 times [2023-08-04 07:15:21,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:15:21,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399181439] [2023-08-04 07:15:21,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:15:21,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:15:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:15:21,502 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 07:15:21,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:15:21,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399181439] [2023-08-04 07:15:21,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399181439] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:15:21,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148188444] [2023-08-04 07:15:21,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:15:21,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:15:21,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:15:21,504 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 07:15:21,506 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 07:15:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:15:21,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-04 07:15:21,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:15:21,645 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 07:15:21,645 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:15:21,731 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 07:15:21,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148188444] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:15:21,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:15:21,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 6 [2023-08-04 07:15:21,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568231302] [2023-08-04 07:15:21,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:15:21,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 07:15:21,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:15:21,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 07:15:21,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-04 07:15:21,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 206 [2023-08-04 07:15:21,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 109 transitions, 1142 flow. Second operand has 7 states, 7 states have (on average 100.28571428571429) internal successors, (702), 7 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:15:21,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:15:21,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 206 [2023-08-04 07:15:21,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:15:41,435 INFO L124 PetriNetUnfolderBase]: 184848/234524 cut-off events. [2023-08-04 07:15:41,435 INFO L125 PetriNetUnfolderBase]: For 1718620/1718620 co-relation queries the response was YES. [2023-08-04 07:15:42,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137011 conditions, 234524 events. 184848/234524 cut-off events. For 1718620/1718620 co-relation queries the response was YES. Maximal size of possible extension queue 7719. Compared 1392677 event pairs, 2721 based on Foata normal form. 10736/245161 useless extension candidates. Maximal degree in co-relation 432274. Up to 72480 conditions per place. [2023-08-04 07:15:43,663 INFO L140 encePairwiseOnDemand]: 185/206 looper letters, 486 selfloop transitions, 357 changer transitions 8/854 dead transitions. [2023-08-04 07:15:43,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 854 transitions, 10520 flow [2023-08-04 07:15:43,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-04 07:15:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-04 07:15:43,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1968 transitions. [2023-08-04 07:15:43,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5619645916619075 [2023-08-04 07:15:43,668 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1968 transitions. [2023-08-04 07:15:43,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1968 transitions. [2023-08-04 07:15:43,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:15:43,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1968 transitions. [2023-08-04 07:15:43,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 115.76470588235294) internal successors, (1968), 17 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:15:43,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 206.0) internal successors, (3708), 18 states have internal predecessors, (3708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:15:43,679 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 206.0) internal successors, (3708), 18 states have internal predecessors, (3708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:15:43,679 INFO L175 Difference]: Start difference. First operand has 88 places, 109 transitions, 1142 flow. Second operand 17 states and 1968 transitions. [2023-08-04 07:15:43,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 854 transitions, 10520 flow [2023-08-04 07:15:44,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 854 transitions, 10451 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:15:44,808 INFO L231 Difference]: Finished difference. Result has 119 places, 511 transitions, 7721 flow [2023-08-04 07:15:44,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=7721, PETRI_PLACES=119, PETRI_TRANSITIONS=511} [2023-08-04 07:15:44,809 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 68 predicate places. [2023-08-04 07:15:44,809 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 511 transitions, 7721 flow [2023-08-04 07:15:44,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.28571428571429) internal successors, (702), 7 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:15:44,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:15:44,809 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:15:44,817 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 07:15:45,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:15:45,016 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:15:45,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:15:45,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1170807628, now seen corresponding path program 1 times [2023-08-04 07:15:45,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:15:45,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810065153] [2023-08-04 07:15:45,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:15:45,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:15:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:15:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 07:15:45,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:15:45,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810065153] [2023-08-04 07:15:45,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810065153] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:15:45,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662204996] [2023-08-04 07:15:45,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:15:45,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:15:45,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:15:45,168 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 07:15:45,171 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 07:15:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:15:45,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-04 07:15:45,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:15:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 07:15:45,424 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:15:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 07:15:45,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662204996] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:15:45,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:15:45,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 6] total 15 [2023-08-04 07:15:45,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921989806] [2023-08-04 07:15:45,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:15:45,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-04 07:15:45,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:15:45,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-04 07:15:45,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-08-04 07:15:45,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 206 [2023-08-04 07:15:45,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 511 transitions, 7721 flow. Second operand has 17 states, 17 states have (on average 95.76470588235294) internal successors, (1628), 17 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:15:45,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:15:45,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 206 [2023-08-04 07:15:45,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:17:22,317 INFO L124 PetriNetUnfolderBase]: 464780/597290 cut-off events. [2023-08-04 07:17:22,317 INFO L125 PetriNetUnfolderBase]: For 7657604/7657604 co-relation queries the response was YES. [2023-08-04 07:17:28,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3960354 conditions, 597290 events. 464780/597290 cut-off events. For 7657604/7657604 co-relation queries the response was YES. Maximal size of possible extension queue 24567. Compared 4099046 event pairs, 3412 based on Foata normal form. 975/598152 useless extension candidates. Maximal degree in co-relation 2209155. Up to 209324 conditions per place. [2023-08-04 07:17:30,310 INFO L140 encePairwiseOnDemand]: 185/206 looper letters, 941 selfloop transitions, 994 changer transitions 358/2296 dead transitions. [2023-08-04 07:17:30,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 2296 transitions, 36196 flow [2023-08-04 07:17:30,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-08-04 07:17:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-08-04 07:17:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 5154 transitions. [2023-08-04 07:17:30,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5439003799071338 [2023-08-04 07:17:30,321 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 5154 transitions. [2023-08-04 07:17:30,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 5154 transitions. [2023-08-04 07:17:30,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:17:30,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 5154 transitions. [2023-08-04 07:17:30,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 112.04347826086956) internal successors, (5154), 46 states have internal predecessors, (5154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:17:30,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 206.0) internal successors, (9682), 47 states have internal predecessors, (9682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:17:30,359 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 206.0) internal successors, (9682), 47 states have internal predecessors, (9682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:17:30,359 INFO L175 Difference]: Start difference. First operand has 119 places, 511 transitions, 7721 flow. Second operand 46 states and 5154 transitions. [2023-08-04 07:17:30,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 2296 transitions, 36196 flow