/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-deagle_circular_buffer_ok_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 04:47:36,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 04:47:37,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 04:47:37,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 04:47:37,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 04:47:37,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 04:47:37,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 04:47:37,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 04:47:37,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 04:47:37,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 04:47:37,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 04:47:37,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 04:47:37,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 04:47:37,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 04:47:37,077 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 04:47:37,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 04:47:37,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 04:47:37,077 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 04:47:37,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 04:47:37,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 04:47:37,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 04:47:37,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 04:47:37,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 04:47:37,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 04:47:37,079 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 04:47:37,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 04:47:37,081 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 04:47:37,081 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 04:47:37,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 04:47:37,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 04:47:37,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 04:47:37,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 04:47:37,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 04:47:37,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 04:47:37,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 04:47:37,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 04:47:37,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 04:47:37,083 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 04:47:37,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 04:47:37,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 04:47:37,084 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 04:47:37,084 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 04:47:37,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 04:47:37,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 04:47:37,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 04:47:37,327 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 04:47:37,328 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 04:47:37,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-deagle_circular_buffer_ok_bound2.i [2023-08-04 04:47:38,546 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 04:47:38,741 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 04:47:38,741 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-deagle_circular_buffer_ok_bound2.i [2023-08-04 04:47:38,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4eb1d8de/2d8f63fa8ef9439da7f9213480c467b0/FLAG791d7e6da [2023-08-04 04:47:38,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4eb1d8de/2d8f63fa8ef9439da7f9213480c467b0 [2023-08-04 04:47:38,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 04:47:38,780 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 04:47:38,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 04:47:38,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 04:47:38,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 04:47:38,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 04:47:38" (1/1) ... [2023-08-04 04:47:38,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4254411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:47:38, skipping insertion in model container [2023-08-04 04:47:38,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 04:47:38" (1/1) ... [2023-08-04 04:47:38,831 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 04:47:39,111 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-deagle_circular_buffer_ok_bound2.i[30451,30464] [2023-08-04 04:47:39,116 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-deagle_circular_buffer_ok_bound2.i[30681,30694] [2023-08-04 04:47:39,122 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-deagle_circular_buffer_ok_bound2.i[30979,30992] [2023-08-04 04:47:39,133 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 04:47:39,143 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 04:47:39,165 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [208] [2023-08-04 04:47:39,167 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [209] [2023-08-04 04:47:39,182 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-deagle_circular_buffer_ok_bound2.i[30451,30464] [2023-08-04 04:47:39,183 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-deagle_circular_buffer_ok_bound2.i[30681,30694] [2023-08-04 04:47:39,185 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-deagle_circular_buffer_ok_bound2.i[30979,30992] [2023-08-04 04:47:39,190 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 04:47:39,225 INFO L206 MainTranslator]: Completed translation [2023-08-04 04:47:39,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:47:39 WrapperNode [2023-08-04 04:47:39,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 04:47:39,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 04:47:39,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 04:47:39,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 04:47:39,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:47:39" (1/1) ... [2023-08-04 04:47:39,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:47:39" (1/1) ... [2023-08-04 04:47:39,293 INFO L138 Inliner]: procedures = 168, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 174 [2023-08-04 04:47:39,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 04:47:39,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 04:47:39,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 04:47:39,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 04:47:39,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:47:39" (1/1) ... [2023-08-04 04:47:39,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:47:39" (1/1) ... [2023-08-04 04:47:39,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:47:39" (1/1) ... [2023-08-04 04:47:39,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:47:39" (1/1) ... [2023-08-04 04:47:39,318 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:47:39" (1/1) ... [2023-08-04 04:47:39,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:47:39" (1/1) ... [2023-08-04 04:47:39,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:47:39" (1/1) ... [2023-08-04 04:47:39,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:47:39" (1/1) ... [2023-08-04 04:47:39,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 04:47:39,328 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 04:47:39,328 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 04:47:39,328 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 04:47:39,329 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:47:39" (1/1) ... [2023-08-04 04:47:39,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 04:47:39,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:47:39,380 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 04:47:39,408 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 04:47:39,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 04:47:39,427 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-04 04:47:39,428 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-04 04:47:39,428 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-04 04:47:39,428 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-04 04:47:39,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 04:47:39,428 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-04 04:47:39,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 04:47:39,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 04:47:39,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 04:47:39,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-08-04 04:47:39,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 04:47:39,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 04:47:39,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 04:47:39,431 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 04:47:39,602 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 04:47:39,604 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 04:47:39,871 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 04:47:39,878 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 04:47:39,878 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-04 04:47:39,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 04:47:39 BoogieIcfgContainer [2023-08-04 04:47:39,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 04:47:39,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 04:47:39,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 04:47:39,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 04:47:39,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 04:47:38" (1/3) ... [2023-08-04 04:47:39,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f39d44f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 04:47:39, skipping insertion in model container [2023-08-04 04:47:39,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:47:39" (2/3) ... [2023-08-04 04:47:39,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f39d44f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 04:47:39, skipping insertion in model container [2023-08-04 04:47:39,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 04:47:39" (3/3) ... [2023-08-04 04:47:39,914 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-deagle_circular_buffer_ok_bound2.i [2023-08-04 04:47:39,922 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 04:47:39,928 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 04:47:39,928 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-08-04 04:47:39,928 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 04:47:40,006 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 04:47:40,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 178 transitions, 378 flow [2023-08-04 04:47:40,147 INFO L124 PetriNetUnfolderBase]: 38/319 cut-off events. [2023-08-04 04:47:40,147 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 04:47:40,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 319 events. 38/319 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1273 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 161. Up to 8 conditions per place. [2023-08-04 04:47:40,165 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 178 transitions, 378 flow [2023-08-04 04:47:40,173 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 178 transitions, 378 flow [2023-08-04 04:47:40,177 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:47:40,185 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 178 transitions, 378 flow [2023-08-04 04:47:40,187 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 178 transitions, 378 flow [2023-08-04 04:47:40,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 178 transitions, 378 flow [2023-08-04 04:47:40,241 INFO L124 PetriNetUnfolderBase]: 38/319 cut-off events. [2023-08-04 04:47:40,242 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 04:47:40,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 319 events. 38/319 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1273 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 161. Up to 8 conditions per place. [2023-08-04 04:47:40,251 INFO L119 LiptonReduction]: Number of co-enabled transitions 10790 [2023-08-04 04:47:44,609 INFO L134 LiptonReduction]: Checked pairs total: 22736 [2023-08-04 04:47:44,609 INFO L136 LiptonReduction]: Total number of compositions: 147 [2023-08-04 04:47:44,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 04:47:44,627 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;@22c96182, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:47:44,627 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-04 04:47:44,633 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:47:44,633 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2023-08-04 04:47:44,633 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 04:47:44,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:47:44,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:47:44,634 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err1ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:47:44,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:47:44,639 INFO L85 PathProgramCache]: Analyzing trace with hash -935757903, now seen corresponding path program 1 times [2023-08-04 04:47:44,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:47:44,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389894968] [2023-08-04 04:47:44,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:47:44,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:47:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:47:45,074 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 04:47:45,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:47:45,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389894968] [2023-08-04 04:47:45,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389894968] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:47:45,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:47:45,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:47:45,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917153098] [2023-08-04 04:47:45,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:47:45,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:47:45,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:47:45,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:47:45,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:47:45,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 325 [2023-08-04 04:47:45,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 54 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:45,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:47:45,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 325 [2023-08-04 04:47:45,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:47:45,708 INFO L124 PetriNetUnfolderBase]: 3221/5365 cut-off events. [2023-08-04 04:47:45,708 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2023-08-04 04:47:45,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10210 conditions, 5365 events. 3221/5365 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 29634 event pairs, 985 based on Foata normal form. 137/3738 useless extension candidates. Maximal degree in co-relation 9258. Up to 2958 conditions per place. [2023-08-04 04:47:45,743 INFO L140 encePairwiseOnDemand]: 319/325 looper letters, 73 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2023-08-04 04:47:45,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 86 transitions, 359 flow [2023-08-04 04:47:45,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:47:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:47:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2023-08-04 04:47:45,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5558974358974359 [2023-08-04 04:47:45,760 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 542 transitions. [2023-08-04 04:47:45,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 542 transitions. [2023-08-04 04:47:45,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:47:45,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 542 transitions. [2023-08-04 04:47:45,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:45,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:45,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:45,779 INFO L175 Difference]: Start difference. First operand has 48 places, 54 transitions, 130 flow. Second operand 3 states and 542 transitions. [2023-08-04 04:47:45,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 86 transitions, 359 flow [2023-08-04 04:47:45,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 86 transitions, 359 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:47:45,788 INFO L231 Difference]: Finished difference. Result has 51 places, 54 transitions, 144 flow [2023-08-04 04:47:45,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=51, PETRI_TRANSITIONS=54} [2023-08-04 04:47:45,793 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2023-08-04 04:47:45,794 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 54 transitions, 144 flow [2023-08-04 04:47:45,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:45,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:47:45,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:47:45,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 04:47:45,795 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err1ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:47:45,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:47:45,797 INFO L85 PathProgramCache]: Analyzing trace with hash 290188576, now seen corresponding path program 1 times [2023-08-04 04:47:45,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:47:45,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774950108] [2023-08-04 04:47:45,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:47:45,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:47:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:47:45,876 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 04:47:45,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:47:45,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774950108] [2023-08-04 04:47:45,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774950108] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:47:45,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:47:45,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:47:45,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142320790] [2023-08-04 04:47:45,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:47:45,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:47:45,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:47:45,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:47:45,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:47:45,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 325 [2023-08-04 04:47:45,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:45,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:47:45,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 325 [2023-08-04 04:47:45,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:47:46,349 INFO L124 PetriNetUnfolderBase]: 3176/5161 cut-off events. [2023-08-04 04:47:46,349 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2023-08-04 04:47:46,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10544 conditions, 5161 events. 3176/5161 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 29240 event pairs, 1239 based on Foata normal form. 0/3636 useless extension candidates. Maximal degree in co-relation 9694. Up to 4637 conditions per place. [2023-08-04 04:47:46,379 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 54 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-08-04 04:47:46,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 291 flow [2023-08-04 04:47:46,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:47:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:47:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2023-08-04 04:47:46,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5364102564102564 [2023-08-04 04:47:46,382 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 523 transitions. [2023-08-04 04:47:46,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 523 transitions. [2023-08-04 04:47:46,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:47:46,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 523 transitions. [2023-08-04 04:47:46,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:46,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:46,391 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:46,391 INFO L175 Difference]: Start difference. First operand has 51 places, 54 transitions, 144 flow. Second operand 3 states and 523 transitions. [2023-08-04 04:47:46,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 291 flow [2023-08-04 04:47:46,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:47:46,397 INFO L231 Difference]: Finished difference. Result has 53 places, 54 transitions, 150 flow [2023-08-04 04:47:46,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=53, PETRI_TRANSITIONS=54} [2023-08-04 04:47:46,398 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2023-08-04 04:47:46,398 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 54 transitions, 150 flow [2023-08-04 04:47:46,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:46,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:47:46,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:47:46,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 04:47:46,399 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err1ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:47:46,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:47:46,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1617767844, now seen corresponding path program 1 times [2023-08-04 04:47:46,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:47:46,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703046584] [2023-08-04 04:47:46,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:47:46,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:47:46,418 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-04 04:47:46,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305133274] [2023-08-04 04:47:46,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:47:46,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:47:46,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:47:46,425 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 04:47:46,435 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 04:47:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:47:46,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-04 04:47:46,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:47:46,582 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 04:47:46,582 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:47:46,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:47:46,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703046584] [2023-08-04 04:47:46,583 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-04 04:47:46,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305133274] [2023-08-04 04:47:46,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305133274] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:47:46,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:47:46,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 04:47:46,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376337752] [2023-08-04 04:47:46,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:47:46,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:47:46,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:47:46,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:47:46,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:47:46,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 325 [2023-08-04 04:47:46,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 54 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:46,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:47:46,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 325 [2023-08-04 04:47:46,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:47:47,235 INFO L124 PetriNetUnfolderBase]: 3398/5637 cut-off events. [2023-08-04 04:47:47,235 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2023-08-04 04:47:47,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11348 conditions, 5637 events. 3398/5637 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 33083 event pairs, 1134 based on Foata normal form. 0/4060 useless extension candidates. Maximal degree in co-relation 10673. Up to 2331 conditions per place. [2023-08-04 04:47:47,272 INFO L140 encePairwiseOnDemand]: 318/325 looper letters, 119 selfloop transitions, 7 changer transitions 0/137 dead transitions. [2023-08-04 04:47:47,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 137 transitions, 616 flow [2023-08-04 04:47:47,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 04:47:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 04:47:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 871 transitions. [2023-08-04 04:47:47,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.536 [2023-08-04 04:47:47,275 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 871 transitions. [2023-08-04 04:47:47,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 871 transitions. [2023-08-04 04:47:47,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:47:47,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 871 transitions. [2023-08-04 04:47:47,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.2) internal successors, (871), 5 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:47,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:47,281 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:47,282 INFO L175 Difference]: Start difference. First operand has 53 places, 54 transitions, 150 flow. Second operand 5 states and 871 transitions. [2023-08-04 04:47:47,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 137 transitions, 616 flow [2023-08-04 04:47:47,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 137 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 04:47:47,286 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 179 flow [2023-08-04 04:47:47,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2023-08-04 04:47:47,287 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2023-08-04 04:47:47,287 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 179 flow [2023-08-04 04:47:47,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:47,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:47:47,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:47:47,295 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 04:47:47,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:47:47,491 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err1ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:47:47,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:47:47,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2083689410, now seen corresponding path program 1 times [2023-08-04 04:47:47,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:47:47,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206570724] [2023-08-04 04:47:47,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:47:47,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:47:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:47:47,550 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 04:47:47,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:47:47,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206570724] [2023-08-04 04:47:47,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206570724] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:47:47,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702830404] [2023-08-04 04:47:47,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:47:47,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:47:47,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:47:47,553 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 04:47:47,576 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 04:47:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:47:47,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 04:47:47,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:47:47,666 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 04:47:47,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:47:47,685 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 04:47:47,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702830404] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:47:47,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:47:47,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 04:47:47,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001358622] [2023-08-04 04:47:47,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:47:47,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:47:47,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:47:47,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:47:47,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:47:47,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 325 [2023-08-04 04:47:47,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 158.2) internal successors, (791), 5 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:47,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:47:47,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 325 [2023-08-04 04:47:47,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:47:47,746 INFO L124 PetriNetUnfolderBase]: 42/115 cut-off events. [2023-08-04 04:47:47,746 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-04 04:47:47,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 115 events. 42/115 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 350 event pairs, 1 based on Foata normal form. 16/119 useless extension candidates. Maximal degree in co-relation 305. Up to 70 conditions per place. [2023-08-04 04:47:47,747 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 29 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-08-04 04:47:47,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 225 flow [2023-08-04 04:47:47,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:47:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:47:47,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 648 transitions. [2023-08-04 04:47:47,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49846153846153846 [2023-08-04 04:47:47,750 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 648 transitions. [2023-08-04 04:47:47,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 648 transitions. [2023-08-04 04:47:47,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:47:47,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 648 transitions. [2023-08-04 04:47:47,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:47,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:47,759 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:47,759 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 179 flow. Second operand 4 states and 648 transitions. [2023-08-04 04:47:47,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 225 flow [2023-08-04 04:47:47,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 38 transitions, 213 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 04:47:47,761 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 87 flow [2023-08-04 04:47:47,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=27, 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=4, PETRI_FLOW=87, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-08-04 04:47:47,762 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -18 predicate places. [2023-08-04 04:47:47,762 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 87 flow [2023-08-04 04:47:47,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 158.2) internal successors, (791), 5 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:47,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:47:47,762 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:47:47,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 04:47:47,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-04 04:47:47,968 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err1ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-04 04:47:47,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:47:47,969 INFO L85 PathProgramCache]: Analyzing trace with hash -185997336, now seen corresponding path program 1 times [2023-08-04 04:47:47,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:47:47,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344707860] [2023-08-04 04:47:47,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:47:47,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:47:47,982 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-04 04:47:47,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1309349960] [2023-08-04 04:47:47,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:47:47,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:47:47,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:47:47,984 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 04:47:47,986 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 04:47:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:47:48,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 04:47:48,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:47:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:47:48,126 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:47:48,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:47:48,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344707860] [2023-08-04 04:47:48,127 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-04 04:47:48,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309349960] [2023-08-04 04:47:48,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309349960] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:47:48,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:47:48,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 04:47:48,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892975850] [2023-08-04 04:47:48,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:47:48,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 04:47:48,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:47:48,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 04:47:48,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 04:47:48,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 325 [2023-08-04 04:47:48,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 157.25) internal successors, (629), 4 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:48,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:47:48,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 325 [2023-08-04 04:47:48,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:47:48,193 INFO L124 PetriNetUnfolderBase]: 29/86 cut-off events. [2023-08-04 04:47:48,193 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-08-04 04:47:48,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 86 events. 29/86 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 180 event pairs, 20 based on Foata normal form. 6/92 useless extension candidates. Maximal degree in co-relation 205. Up to 64 conditions per place. [2023-08-04 04:47:48,193 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 0 selfloop transitions, 0 changer transitions 18/18 dead transitions. [2023-08-04 04:47:48,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 18 transitions, 95 flow [2023-08-04 04:47:48,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:47:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:47:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2023-08-04 04:47:48,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2023-08-04 04:47:48,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 475 transitions. [2023-08-04 04:47:48,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 475 transitions. [2023-08-04 04:47:48,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:47:48,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 475 transitions. [2023-08-04 04:47:48,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:48,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:48,200 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:48,200 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 87 flow. Second operand 3 states and 475 transitions. [2023-08-04 04:47:48,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 18 transitions, 95 flow [2023-08-04 04:47:48,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 18 transitions, 86 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 04:47:48,202 INFO L231 Difference]: Finished difference. Result has 25 places, 0 transitions, 0 flow [2023-08-04 04:47:48,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=25, PETRI_TRANSITIONS=0} [2023-08-04 04:47:48,204 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -23 predicate places. [2023-08-04 04:47:48,204 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 0 transitions, 0 flow [2023-08-04 04:47:48,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.25) internal successors, (629), 4 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:48,208 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-04 04:47:48,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-04 04:47:48,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-04 04:47:48,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-08-04 04:47:48,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-08-04 04:47:48,209 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-04 04:47:48,219 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 04:47:48,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:47:48,415 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 04:47:48,417 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-04 04:47:48,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 178 transitions, 378 flow [2023-08-04 04:47:48,445 INFO L124 PetriNetUnfolderBase]: 38/319 cut-off events. [2023-08-04 04:47:48,445 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 04:47:48,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 319 events. 38/319 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1273 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 161. Up to 8 conditions per place. [2023-08-04 04:47:48,446 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 178 transitions, 378 flow [2023-08-04 04:47:48,448 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 178 transitions, 378 flow [2023-08-04 04:47:48,448 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:47:48,448 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 178 transitions, 378 flow [2023-08-04 04:47:48,448 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 178 transitions, 378 flow [2023-08-04 04:47:48,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 178 transitions, 378 flow [2023-08-04 04:47:48,470 INFO L124 PetriNetUnfolderBase]: 38/319 cut-off events. [2023-08-04 04:47:48,470 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 04:47:48,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 319 events. 38/319 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1273 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 161. Up to 8 conditions per place. [2023-08-04 04:47:48,503 INFO L119 LiptonReduction]: Number of co-enabled transitions 10790 [2023-08-04 04:47:52,541 INFO L134 LiptonReduction]: Checked pairs total: 22938 [2023-08-04 04:47:52,541 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-08-04 04:47:52,543 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 04:47:52,544 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;@22c96182, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:47:52,544 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 04:47:52,547 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:47:52,547 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2023-08-04 04:47:52,547 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:47:52,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:47:52,548 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 04:47:52,548 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 04:47:52,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:47:52,548 INFO L85 PathProgramCache]: Analyzing trace with hash -701196597, now seen corresponding path program 1 times [2023-08-04 04:47:52,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:47:52,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699024153] [2023-08-04 04:47:52,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:47:52,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:47:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 04:47:52,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 04:47:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 04:47:52,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 04:47:52,608 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 04:47:52,608 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 04:47:52,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 04:47:52,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 04:47:52,608 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 04:47:52,609 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 04:47:52,609 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 04:47:52,609 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 04:47:52,646 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 04:47:52,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 240 places, 265 transitions, 578 flow [2023-08-04 04:47:52,788 INFO L124 PetriNetUnfolderBase]: 143/931 cut-off events. [2023-08-04 04:47:52,788 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 04:47:52,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 931 events. 143/931 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5349 event pairs, 1 based on Foata normal form. 0/791 useless extension candidates. Maximal degree in co-relation 572. Up to 32 conditions per place. [2023-08-04 04:47:52,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 240 places, 265 transitions, 578 flow [2023-08-04 04:47:52,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 240 places, 265 transitions, 578 flow [2023-08-04 04:47:52,799 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:47:52,800 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 240 places, 265 transitions, 578 flow [2023-08-04 04:47:52,800 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 240 places, 265 transitions, 578 flow [2023-08-04 04:47:52,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 240 places, 265 transitions, 578 flow [2023-08-04 04:47:52,899 INFO L124 PetriNetUnfolderBase]: 143/931 cut-off events. [2023-08-04 04:47:52,899 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 04:47:52,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 931 events. 143/931 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5349 event pairs, 1 based on Foata normal form. 0/791 useless extension candidates. Maximal degree in co-relation 572. Up to 32 conditions per place. [2023-08-04 04:47:52,944 INFO L119 LiptonReduction]: Number of co-enabled transitions 36332 [2023-08-04 04:47:57,392 INFO L134 LiptonReduction]: Checked pairs total: 112672 [2023-08-04 04:47:57,392 INFO L136 LiptonReduction]: Total number of compositions: 201 [2023-08-04 04:47:57,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 04:47:57,401 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;@22c96182, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:47:57,401 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-04 04:47:57,404 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:47:57,404 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2023-08-04 04:47:57,404 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 04:47:57,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:47:57,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:47:57,405 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err1ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-04 04:47:57,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:47:57,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1802350227, now seen corresponding path program 1 times [2023-08-04 04:47:57,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:47:57,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785313144] [2023-08-04 04:47:57,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:47:57,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:47:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:47:57,518 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 04:47:57,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:47:57,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785313144] [2023-08-04 04:47:57,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785313144] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:47:57,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:47:57,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:47:57,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741973471] [2023-08-04 04:47:57,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:47:57,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:47:57,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:47:57,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:47:57,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:47:57,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 466 [2023-08-04 04:47:57,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 102 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:47:57,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:47:57,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 466 [2023-08-04 04:47:57,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:49:15,771 INFO L124 PetriNetUnfolderBase]: 1074893/1471789 cut-off events. [2023-08-04 04:49:15,771 INFO L125 PetriNetUnfolderBase]: For 65428/65428 co-relation queries the response was YES. [2023-08-04 04:49:18,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2822936 conditions, 1471789 events. 1074893/1471789 cut-off events. For 65428/65428 co-relation queries the response was YES. Maximal size of possible extension queue 33216. Compared 12119207 event pairs, 248328 based on Foata normal form. 41712/1038306 useless extension candidates. Maximal degree in co-relation 1725422. Up to 1047781 conditions per place. [2023-08-04 04:49:23,771 INFO L140 encePairwiseOnDemand]: 456/466 looper letters, 132 selfloop transitions, 3 changer transitions 0/158 dead transitions. [2023-08-04 04:49:23,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 158 transitions, 671 flow [2023-08-04 04:49:23,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:49:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:49:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 814 transitions. [2023-08-04 04:49:23,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5822603719599427 [2023-08-04 04:49:23,774 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 814 transitions. [2023-08-04 04:49:23,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 814 transitions. [2023-08-04 04:49:23,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:49:23,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 814 transitions. [2023-08-04 04:49:23,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:49:23,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:49:23,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:49:23,780 INFO L175 Difference]: Start difference. First operand has 88 places, 102 transitions, 252 flow. Second operand 3 states and 814 transitions. [2023-08-04 04:49:23,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 158 transitions, 671 flow [2023-08-04 04:49:23,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 158 transitions, 671 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:49:23,826 INFO L231 Difference]: Finished difference. Result has 91 places, 101 transitions, 271 flow [2023-08-04 04:49:23,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=91, PETRI_TRANSITIONS=101} [2023-08-04 04:49:23,827 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 3 predicate places. [2023-08-04 04:49:23,827 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 101 transitions, 271 flow [2023-08-04 04:49:23,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:49:23,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:49:23,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:49:23,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 04:49:23,828 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err1ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-04 04:49:23,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:49:23,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1804286569, now seen corresponding path program 1 times [2023-08-04 04:49:23,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:49:23,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131422914] [2023-08-04 04:49:23,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:49:23,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:49:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:49:23,857 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 04:49:23,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:49:23,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131422914] [2023-08-04 04:49:23,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131422914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:49:23,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:49:23,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:49:23,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109402878] [2023-08-04 04:49:23,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:49:23,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:49:23,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:49:23,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:49:23,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:49:23,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 466 [2023-08-04 04:49:23,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 101 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:49:23,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:49:23,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 466 [2023-08-04 04:49:23,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:50:55,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1294] L748-->L698: Formula: (and (< (mod v_~first~0_102 4294967296) (mod v_~buffer_size~0_146 4294967296)) (< 0 (mod v_~next~0_173 4294967296))) InVars {~next~0=v_~next~0_173, ~first~0=v_~first~0_102, ~buffer_size~0=v_~buffer_size~0_146} OutVars{~next~0=v_~next~0_173, ~first~0=v_~first~0_102, t2Thread1of2ForFork1_removeLogElement_#res#1=|v_t2Thread1of2ForFork1_removeLogElement_#res#1_21|, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~mem2#1_21|, ~buffer_size~0=v_~buffer_size~0_146, t2Thread1of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~post1#1_19|} AuxVars[] AssignedVars[t2Thread1of2ForFork1_removeLogElement_#res#1, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1, t2Thread1of2ForFork1_removeLogElement_#t~post1#1][88], [57#L765-4true, t1Thread2of2ForFork0InUse, 248#true, 161#L713true, 74#L698true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, t2Thread2of2ForFork1NotInUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:55,738 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-08-04 04:50:55,739 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:55,739 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 04:50:55,739 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1294] L748-->L698: Formula: (and (< (mod v_~first~0_102 4294967296) (mod v_~buffer_size~0_146 4294967296)) (< 0 (mod v_~next~0_173 4294967296))) InVars {~next~0=v_~next~0_173, ~first~0=v_~first~0_102, ~buffer_size~0=v_~buffer_size~0_146} OutVars{~next~0=v_~next~0_173, ~first~0=v_~first~0_102, t2Thread1of2ForFork1_removeLogElement_#res#1=|v_t2Thread1of2ForFork1_removeLogElement_#res#1_21|, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~mem2#1_21|, ~buffer_size~0=v_~buffer_size~0_146, t2Thread1of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~post1#1_19|} AuxVars[] AssignedVars[t2Thread1of2ForFork1_removeLogElement_#res#1, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1, t2Thread1of2ForFork1_removeLogElement_#t~post1#1][88], [t1Thread2of2ForFork0InUse, 248#true, 74#L698true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, t2Thread2of2ForFork1NotInUse, 127#L766-4true, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,466 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-08-04 04:50:56,466 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 04:50:56,466 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 04:50:56,466 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 04:50:56,685 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [69#L764-6true, t1Thread2of2ForFork0InUse, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 218#L743-6true, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,685 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-08-04 04:50:56,685 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 04:50:56,685 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 04:50:56,685 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 04:50:56,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [69#L764-6true, t1Thread2of2ForFork0InUse, 248#true, 161#L713true, 20#L745-1true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,764 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 04:50:56,764 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 04:50:56,781 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 04:50:56,781 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 04:50:56,782 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [69#L764-6true, 60#t2EXITtrue, t1Thread2of2ForFork0InUse, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,782 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-04 04:50:56,782 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 04:50:56,782 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 04:50:56,782 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 04:50:56,794 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 34#L764-11true, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, 218#L743-6true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,795 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 04:50:56,795 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 04:50:56,795 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 04:50:56,795 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 04:50:56,796 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [69#L764-6true, t1Thread2of2ForFork0InUse, 248#true, 161#L713true, 185#L748true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,796 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 04:50:56,796 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 04:50:56,796 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 04:50:56,796 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 04:50:56,806 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1294] L748-->L698: Formula: (and (< (mod v_~first~0_102 4294967296) (mod v_~buffer_size~0_146 4294967296)) (< 0 (mod v_~next~0_173 4294967296))) InVars {~next~0=v_~next~0_173, ~first~0=v_~first~0_102, ~buffer_size~0=v_~buffer_size~0_146} OutVars{~next~0=v_~next~0_173, ~first~0=v_~first~0_102, t2Thread1of2ForFork1_removeLogElement_#res#1=|v_t2Thread1of2ForFork1_removeLogElement_#res#1_21|, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~mem2#1_21|, ~buffer_size~0=v_~buffer_size~0_146, t2Thread1of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~post1#1_19|} AuxVars[] AssignedVars[t2Thread1of2ForFork1_removeLogElement_#res#1, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1, t2Thread1of2ForFork1_removeLogElement_#t~post1#1][88], [69#L764-6true, t1Thread2of2ForFork0InUse, 248#true, 161#L713true, 74#L698true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 13#L748true, 166#L713true, t2Thread1of2ForFork1InUse, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,807 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-04 04:50:56,807 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 04:50:56,807 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 04:50:56,807 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 04:50:56,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 218#L743-6true, 152#L698true, 52#L764-5true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,810 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-04 04:50:56,810 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 04:50:56,810 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 04:50:56,810 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 04:50:56,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 218#L743-6true, 152#L698true, t2Thread2of2ForFork1InUse, 167#L765-8true, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,814 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-04 04:50:56,814 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 04:50:56,814 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 04:50:56,814 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 04:50:56,815 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 34#L764-11true, 248#true, 161#L713true, 20#L745-1true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,816 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-04 04:50:56,816 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 04:50:56,816 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 04:50:56,816 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 04:50:56,850 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [60#t2EXITtrue, t1Thread2of2ForFork0InUse, 34#L764-11true, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,850 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-04 04:50:56,850 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 04:50:56,850 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 04:50:56,850 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 04:50:56,851 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, 20#L745-1true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, 52#L764-5true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,851 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-04 04:50:56,851 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 04:50:56,851 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 04:50:56,851 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 04:50:56,852 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [60#t2EXITtrue, t1Thread2of2ForFork0InUse, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, 52#L764-5true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,852 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-04 04:50:56,852 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 04:50:56,852 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 04:50:56,852 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 04:50:56,866 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 218#L743-6true, 152#L698true, 155#L765-3true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,866 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-04 04:50:56,866 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 04:50:56,866 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 04:50:56,866 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 04:50:56,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, 103#L766-8true, t2Thread1of2ForFork1InUse, 152#L698true, 218#L743-6true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,867 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-04 04:50:56,867 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 04:50:56,867 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 04:50:56,868 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 04:50:56,868 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, 20#L745-1true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, 167#L765-8true, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,869 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-04 04:50:56,869 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 04:50:56,869 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 04:50:56,869 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 04:50:56,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [60#t2EXITtrue, t1Thread2of2ForFork0InUse, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, 167#L765-8true, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,870 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-04 04:50:56,870 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 04:50:56,870 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 04:50:56,870 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 04:50:56,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 34#L764-11true, 248#true, 161#L713true, 185#L748true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,871 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-04 04:50:56,871 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 04:50:56,871 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 04:50:56,871 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 04:50:56,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1294] L748-->L698: Formula: (and (< (mod v_~first~0_102 4294967296) (mod v_~buffer_size~0_146 4294967296)) (< 0 (mod v_~next~0_173 4294967296))) InVars {~next~0=v_~next~0_173, ~first~0=v_~first~0_102, ~buffer_size~0=v_~buffer_size~0_146} OutVars{~next~0=v_~next~0_173, ~first~0=v_~first~0_102, t2Thread1of2ForFork1_removeLogElement_#res#1=|v_t2Thread1of2ForFork1_removeLogElement_#res#1_21|, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~mem2#1_21|, ~buffer_size~0=v_~buffer_size~0_146, t2Thread1of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~post1#1_19|} AuxVars[] AssignedVars[t2Thread1of2ForFork1_removeLogElement_#res#1, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1, t2Thread1of2ForFork1_removeLogElement_#t~post1#1][88], [t1Thread2of2ForFork0InUse, 34#L764-11true, 248#true, 74#L698true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, 13#L748true, t2Thread1of2ForFork1InUse, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,871 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-04 04:50:56,871 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 04:50:56,871 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 04:50:56,872 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-04 04:50:56,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, 185#L748true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, 52#L764-5true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,873 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-04 04:50:56,873 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,873 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 04:50:56,873 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1294] L748-->L698: Formula: (and (< (mod v_~first~0_102 4294967296) (mod v_~buffer_size~0_146 4294967296)) (< 0 (mod v_~next~0_173 4294967296))) InVars {~next~0=v_~next~0_173, ~first~0=v_~first~0_102, ~buffer_size~0=v_~buffer_size~0_146} OutVars{~next~0=v_~next~0_173, ~first~0=v_~first~0_102, t2Thread1of2ForFork1_removeLogElement_#res#1=|v_t2Thread1of2ForFork1_removeLogElement_#res#1_21|, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~mem2#1_21|, ~buffer_size~0=v_~buffer_size~0_146, t2Thread1of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~post1#1_19|} AuxVars[] AssignedVars[t2Thread1of2ForFork1_removeLogElement_#res#1, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1, t2Thread1of2ForFork1_removeLogElement_#t~post1#1][88], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, 74#L698true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 13#L748true, 166#L713true, t2Thread1of2ForFork1InUse, 52#L764-5true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,873 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-04 04:50:56,873 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 04:50:56,873 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,873 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, 20#L745-1true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, 155#L765-3true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,875 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-04 04:50:56,875 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 04:50:56,875 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,875 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [60#t2EXITtrue, t1Thread2of2ForFork0InUse, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, 155#L765-3true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,876 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-04 04:50:56,876 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,876 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,876 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 04:50:56,906 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 113#ULTIMATE.startEXITtrue, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, 218#L743-6true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,906 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-04 04:50:56,906 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 04:50:56,906 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,906 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 30#L766-3true, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, 218#L743-6true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,907 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-04 04:50:56,908 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 04:50:56,908 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,908 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, 20#L745-1true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, 103#L766-8true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,909 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-04 04:50:56,909 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,909 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,909 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 04:50:56,910 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [60#t2EXITtrue, t1Thread2of2ForFork0InUse, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, 103#L766-8true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,910 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-04 04:50:56,910 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 04:50:56,910 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,910 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,911 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, 185#L748true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, 167#L765-8true, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,911 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-04 04:50:56,911 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,911 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,911 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 04:50:56,911 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1294] L748-->L698: Formula: (and (< (mod v_~first~0_102 4294967296) (mod v_~buffer_size~0_146 4294967296)) (< 0 (mod v_~next~0_173 4294967296))) InVars {~next~0=v_~next~0_173, ~first~0=v_~first~0_102, ~buffer_size~0=v_~buffer_size~0_146} OutVars{~next~0=v_~next~0_173, ~first~0=v_~first~0_102, t2Thread1of2ForFork1_removeLogElement_#res#1=|v_t2Thread1of2ForFork1_removeLogElement_#res#1_21|, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~mem2#1_21|, ~buffer_size~0=v_~buffer_size~0_146, t2Thread1of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~post1#1_19|} AuxVars[] AssignedVars[t2Thread1of2ForFork1_removeLogElement_#res#1, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1, t2Thread1of2ForFork1_removeLogElement_#t~post1#1][88], [t1Thread2of2ForFork0InUse, 248#true, 74#L698true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, 13#L748true, t2Thread1of2ForFork1InUse, t2Thread2of2ForFork1InUse, 167#L765-8true, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,911 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-04 04:50:56,912 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 04:50:56,912 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,912 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-04 04:50:56,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 248#true, 185#L748true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, 155#L765-3true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,913 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-04 04:50:56,913 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 04:50:56,913 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,913 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1294] L748-->L698: Formula: (and (< (mod v_~first~0_102 4294967296) (mod v_~buffer_size~0_146 4294967296)) (< 0 (mod v_~next~0_173 4294967296))) InVars {~next~0=v_~next~0_173, ~first~0=v_~first~0_102, ~buffer_size~0=v_~buffer_size~0_146} OutVars{~next~0=v_~next~0_173, ~first~0=v_~first~0_102, t2Thread1of2ForFork1_removeLogElement_#res#1=|v_t2Thread1of2ForFork1_removeLogElement_#res#1_21|, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~mem2#1_21|, ~buffer_size~0=v_~buffer_size~0_146, t2Thread1of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~post1#1_19|} AuxVars[] AssignedVars[t2Thread1of2ForFork1_removeLogElement_#res#1, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1, t2Thread1of2ForFork1_removeLogElement_#t~post1#1][88], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, 74#L698true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 13#L748true, 166#L713true, t2Thread1of2ForFork1InUse, 155#L765-3true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,914 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-04 04:50:56,914 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 04:50:56,914 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,914 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [57#L765-4true, t1Thread2of2ForFork0InUse, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1NotInUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,915 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-04 04:50:56,915 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 04:50:56,915 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,915 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 113#ULTIMATE.startEXITtrue, 248#true, 20#L745-1true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,916 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-04 04:50:56,916 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,916 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,916 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 04:50:56,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [60#t2EXITtrue, t1Thread2of2ForFork0InUse, 113#ULTIMATE.startEXITtrue, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,917 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-04 04:50:56,917 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,917 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,917 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 04:50:56,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 30#L766-3true, 248#true, 161#L713true, 20#L745-1true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,918 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-04 04:50:56,918 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 04:50:56,918 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,918 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [60#t2EXITtrue, t1Thread2of2ForFork0InUse, 30#L766-3true, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,919 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-04 04:50:56,919 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 04:50:56,919 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,919 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,921 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, 185#L748true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, 103#L766-8true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,921 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-04 04:50:56,921 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,921 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,921 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 04:50:56,921 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1294] L748-->L698: Formula: (and (< (mod v_~first~0_102 4294967296) (mod v_~buffer_size~0_146 4294967296)) (< 0 (mod v_~next~0_173 4294967296))) InVars {~next~0=v_~next~0_173, ~first~0=v_~first~0_102, ~buffer_size~0=v_~buffer_size~0_146} OutVars{~next~0=v_~next~0_173, ~first~0=v_~first~0_102, t2Thread1of2ForFork1_removeLogElement_#res#1=|v_t2Thread1of2ForFork1_removeLogElement_#res#1_21|, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~mem2#1_21|, ~buffer_size~0=v_~buffer_size~0_146, t2Thread1of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~post1#1_19|} AuxVars[] AssignedVars[t2Thread1of2ForFork1_removeLogElement_#res#1, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1, t2Thread1of2ForFork1_removeLogElement_#t~post1#1][88], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, 74#L698true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, 103#L766-8true, 13#L748true, t2Thread1of2ForFork1InUse, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,921 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-04 04:50:56,922 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,922 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 04:50:56,922 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-04 04:50:56,941 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 113#ULTIMATE.startEXITtrue, 248#true, 161#L713true, 185#L748true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,941 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-04 04:50:56,941 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 04:50:56,941 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 04:50:56,941 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 04:50:56,941 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1294] L748-->L698: Formula: (and (< (mod v_~first~0_102 4294967296) (mod v_~buffer_size~0_146 4294967296)) (< 0 (mod v_~next~0_173 4294967296))) InVars {~next~0=v_~next~0_173, ~first~0=v_~first~0_102, ~buffer_size~0=v_~buffer_size~0_146} OutVars{~next~0=v_~next~0_173, ~first~0=v_~first~0_102, t2Thread1of2ForFork1_removeLogElement_#res#1=|v_t2Thread1of2ForFork1_removeLogElement_#res#1_21|, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~mem2#1_21|, ~buffer_size~0=v_~buffer_size~0_146, t2Thread1of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~post1#1_19|} AuxVars[] AssignedVars[t2Thread1of2ForFork1_removeLogElement_#res#1, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1, t2Thread1of2ForFork1_removeLogElement_#t~post1#1][88], [t1Thread2of2ForFork0InUse, 113#ULTIMATE.startEXITtrue, 248#true, 161#L713true, 74#L698true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 13#L748true, 166#L713true, t2Thread1of2ForFork1InUse, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,941 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-04 04:50:56,941 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 04:50:56,941 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 04:50:56,942 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 04:50:56,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 30#L766-3true, 248#true, 161#L713true, 185#L748true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1InUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,944 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-04 04:50:56,944 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 04:50:56,944 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 04:50:56,944 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 04:50:56,944 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1294] L748-->L698: Formula: (and (< (mod v_~first~0_102 4294967296) (mod v_~buffer_size~0_146 4294967296)) (< 0 (mod v_~next~0_173 4294967296))) InVars {~next~0=v_~next~0_173, ~first~0=v_~first~0_102, ~buffer_size~0=v_~buffer_size~0_146} OutVars{~next~0=v_~next~0_173, ~first~0=v_~first~0_102, t2Thread1of2ForFork1_removeLogElement_#res#1=|v_t2Thread1of2ForFork1_removeLogElement_#res#1_21|, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~mem2#1_21|, ~buffer_size~0=v_~buffer_size~0_146, t2Thread1of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread1of2ForFork1_removeLogElement_#t~post1#1_19|} AuxVars[] AssignedVars[t2Thread1of2ForFork1_removeLogElement_#res#1, t2Thread1of2ForFork1_removeLogElement_#t~mem2#1, t2Thread1of2ForFork1_removeLogElement_#t~post1#1][88], [t1Thread2of2ForFork0InUse, 30#L766-3true, 248#true, 161#L713true, 74#L698true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, 13#L748true, t2Thread1of2ForFork1InUse, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,944 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-04 04:50:56,944 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 04:50:56,945 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 04:50:56,945 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 04:50:56,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1NotInUse, 127#L766-4true, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,946 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-04 04:50:56,946 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 04:50:56,946 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 04:50:56,946 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-04 04:50:56,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1NotInUse, 152#L698true, t2Thread2of2ForFork1InUse, 167#L765-8true, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,949 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-04 04:50:56,949 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-04 04:50:56,949 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 04:50:56,949 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-04 04:50:56,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1NotInUse, 152#L698true, 155#L765-3true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,950 INFO L294 olderBase$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-04 04:50:56,951 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 04:50:56,951 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 04:50:56,951 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 04:50:56,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, 103#L766-8true, t2Thread1of2ForFork1NotInUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,952 INFO L294 olderBase$Statistics]: this new event has 61 ancestors and is cut-off event [2023-08-04 04:50:56,953 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 04:50:56,953 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 04:50:56,968 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-08-04 04:50:56,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 113#ULTIMATE.startEXITtrue, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1NotInUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,970 INFO L294 olderBase$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-04 04:50:56,970 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 04:50:56,970 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 04:50:56,970 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 04:50:56,971 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1317] L748-->L698: Formula: (and (< (mod v_~first~0_108 4294967296) (mod v_~buffer_size~0_152 4294967296)) (< 0 (mod v_~next~0_179 4294967296))) InVars {~next~0=v_~next~0_179, ~first~0=v_~first~0_108, ~buffer_size~0=v_~buffer_size~0_152} OutVars{~next~0=v_~next~0_179, ~first~0=v_~first~0_108, t2Thread2of2ForFork1_removeLogElement_#res#1=|v_t2Thread2of2ForFork1_removeLogElement_#res#1_19|, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~mem2#1_19|, ~buffer_size~0=v_~buffer_size~0_152, t2Thread2of2ForFork1_removeLogElement_#t~post1#1=|v_t2Thread2of2ForFork1_removeLogElement_#t~post1#1_15|} AuxVars[] AssignedVars[t2Thread2of2ForFork1_removeLogElement_#res#1, t2Thread2of2ForFork1_removeLogElement_#t~mem2#1, t2Thread2of2ForFork1_removeLogElement_#t~post1#1][107], [t1Thread2of2ForFork0InUse, 30#L766-3true, 248#true, 161#L713true, Black: 245#(and (= ~next~0 0) (= ~buffer_size~0 10)), 243#true, 166#L713true, t2Thread1of2ForFork1NotInUse, 152#L698true, t2Thread2of2ForFork1InUse, t1Thread1of2ForFork0InUse]) [2023-08-04 04:50:56,972 INFO L294 olderBase$Statistics]: this new event has 62 ancestors and is cut-off event [2023-08-04 04:50:56,972 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 04:50:56,972 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 04:50:56,972 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-08-04 04:50:56,972 INFO L124 PetriNetUnfolderBase]: 1085960/1447055 cut-off events. [2023-08-04 04:50:56,972 INFO L125 PetriNetUnfolderBase]: For 114882/115282 co-relation queries the response was YES. [2023-08-04 04:51:01,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876778 conditions, 1447055 events. 1085960/1447055 cut-off events. For 114882/115282 co-relation queries the response was YES. Maximal size of possible extension queue 38489. Compared 11386552 event pairs, 707295 based on Foata normal form. 0/1014247 useless extension candidates. Maximal degree in co-relation 1638092. Up to 1322606 conditions per place. [2023-08-04 04:51:10,501 INFO L140 encePairwiseOnDemand]: 463/466 looper letters, 85 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2023-08-04 04:51:10,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 114 transitions, 473 flow [2023-08-04 04:51:10,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:51:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:51:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2023-08-04 04:51:10,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5543633762517882 [2023-08-04 04:51:10,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 775 transitions. [2023-08-04 04:51:10,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 775 transitions. [2023-08-04 04:51:10,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:51:10,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 775 transitions. [2023-08-04 04:51:10,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 258.3333333333333) internal successors, (775), 3 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:51:10,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:51:10,540 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:51:10,540 INFO L175 Difference]: Start difference. First operand has 91 places, 101 transitions, 271 flow. Second operand 3 states and 775 transitions. [2023-08-04 04:51:10,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 114 transitions, 473 flow [2023-08-04 04:51:10,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 114 transitions, 470 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:51:10,611 INFO L231 Difference]: Finished difference. Result has 93 places, 102 transitions, 280 flow [2023-08-04 04:51:10,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=93, PETRI_TRANSITIONS=102} [2023-08-04 04:51:10,613 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2023-08-04 04:51:10,613 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 102 transitions, 280 flow [2023-08-04 04:51:10,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:51:10,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:51:10,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:51:10,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 04:51:10,614 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err1ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-04 04:51:10,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:51:10,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1191407645, now seen corresponding path program 1 times [2023-08-04 04:51:10,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:51:10,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027798037] [2023-08-04 04:51:10,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:51:10,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:51:10,662 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-04 04:51:10,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [706650] [2023-08-04 04:51:10,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:51:10,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:51:10,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:51:10,689 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 04:51:10,745 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 04:51:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:51:10,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 04:51:10,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:51:11,072 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 04:51:11,073 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:51:11,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:51:11,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027798037] [2023-08-04 04:51:11,073 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-04 04:51:11,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706650] [2023-08-04 04:51:11,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706650] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:51:11,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:51:11,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 04:51:11,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546186399] [2023-08-04 04:51:11,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:51:11,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 04:51:11,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:51:11,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 04:51:11,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 04:51:13,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-08-04 04:51:15,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-08-04 04:51:17,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-08-04 04:51:17,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 466 [2023-08-04 04:51:17,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 102 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 222.25) internal successors, (889), 4 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:51:17,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:51:17,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 466 [2023-08-04 04:51:17,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:52:37,499 INFO L124 PetriNetUnfolderBase]: 968037/1286980 cut-off events. [2023-08-04 04:52:37,499 INFO L125 PetriNetUnfolderBase]: For 143325/143325 co-relation queries the response was YES. [2023-08-04 04:52:41,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2600796 conditions, 1286980 events. 968037/1286980 cut-off events. For 143325/143325 co-relation queries the response was YES. Maximal size of possible extension queue 28679. Compared 9789661 event pairs, 741190 based on Foata normal form. 0/947854 useless extension candidates. Maximal degree in co-relation 2600671. Up to 1179702 conditions per place. [2023-08-04 04:52:47,792 INFO L140 encePairwiseOnDemand]: 463/466 looper letters, 76 selfloop transitions, 1 changer transitions 0/100 dead transitions. [2023-08-04 04:52:47,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 100 transitions, 430 flow [2023-08-04 04:52:47,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:52:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:52:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2023-08-04 04:52:47,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5264663805436338 [2023-08-04 04:52:47,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 736 transitions. [2023-08-04 04:52:47,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 736 transitions. [2023-08-04 04:52:47,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:52:47,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 736 transitions. [2023-08-04 04:52:47,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:52:47,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:52:47,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:52:47,808 INFO L175 Difference]: Start difference. First operand has 93 places, 102 transitions, 280 flow. Second operand 3 states and 736 transitions. [2023-08-04 04:52:47,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 100 transitions, 430 flow [2023-08-04 04:52:47,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 100 transitions, 428 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:52:47,850 INFO L231 Difference]: Finished difference. Result has 92 places, 100 transitions, 276 flow [2023-08-04 04:52:47,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=92, PETRI_TRANSITIONS=100} [2023-08-04 04:52:47,853 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 4 predicate places. [2023-08-04 04:52:47,869 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 100 transitions, 276 flow [2023-08-04 04:52:47,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 222.25) internal successors, (889), 4 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:52:47,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:52:47,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:52:47,876 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 04:52:48,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:52:48,072 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err1ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-04 04:52:48,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:52:48,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1721073327, now seen corresponding path program 1 times [2023-08-04 04:52:48,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:52:48,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795377115] [2023-08-04 04:52:48,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:52:48,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:52:48,110 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-04 04:52:48,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1716458435] [2023-08-04 04:52:48,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:52:48,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:52:48,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:52:48,125 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 04:52:48,180 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 04:52:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:52:48,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-04 04:52:48,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:52:48,334 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 04:52:48,334 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:52:48,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:52:48,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795377115] [2023-08-04 04:52:48,334 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-04 04:52:48,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716458435] [2023-08-04 04:52:48,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716458435] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:52:48,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:52:48,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 04:52:48,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966450024] [2023-08-04 04:52:48,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:52:48,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:52:48,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:52:48,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:52:48,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:52:48,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 466 [2023-08-04 04:52:48,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 100 transitions, 276 flow. Second operand has 5 states, 5 states have (on average 223.8) internal successors, (1119), 5 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:52:48,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:52:48,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 466 [2023-08-04 04:52:48,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:54:11,819 INFO L124 PetriNetUnfolderBase]: 992196/1356224 cut-off events. [2023-08-04 04:54:11,820 INFO L125 PetriNetUnfolderBase]: For 99097/99608 co-relation queries the response was YES. [2023-08-04 04:54:16,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2682817 conditions, 1356224 events. 992196/1356224 cut-off events. For 99097/99608 co-relation queries the response was YES. Maximal size of possible extension queue 30270. Compared 11273398 event pairs, 356760 based on Foata normal form. 92/1004120 useless extension candidates. Maximal degree in co-relation 2682803. Up to 581251 conditions per place. [2023-08-04 04:54:23,611 INFO L140 encePairwiseOnDemand]: 459/466 looper letters, 246 selfloop transitions, 6 changer transitions 0/279 dead transitions. [2023-08-04 04:54:23,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 279 transitions, 1267 flow [2023-08-04 04:54:23,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 04:54:23,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 04:54:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1359 transitions. [2023-08-04 04:54:23,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5832618025751073 [2023-08-04 04:54:23,623 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1359 transitions. [2023-08-04 04:54:23,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1359 transitions. [2023-08-04 04:54:23,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:54:23,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1359 transitions. [2023-08-04 04:54:23,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 271.8) internal successors, (1359), 5 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:54:23,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:54:23,639 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 466.0) internal successors, (2796), 6 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:54:23,639 INFO L175 Difference]: Start difference. First operand has 92 places, 100 transitions, 276 flow. Second operand 5 states and 1359 transitions. [2023-08-04 04:54:23,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 279 transitions, 1267 flow [2023-08-04 04:54:23,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 279 transitions, 1266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:54:23,831 INFO L231 Difference]: Finished difference. Result has 97 places, 102 transitions, 304 flow [2023-08-04 04:54:23,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=97, PETRI_TRANSITIONS=102} [2023-08-04 04:54:23,832 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 9 predicate places. [2023-08-04 04:54:23,832 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 102 transitions, 304 flow [2023-08-04 04:54:23,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 223.8) internal successors, (1119), 5 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:54:23,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:54:23,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:54:23,839 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 04:54:24,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-04 04:54:24,039 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err1ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-04 04:54:24,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:54:24,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1105481096, now seen corresponding path program 1 times [2023-08-04 04:54:24,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:54:24,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12756170] [2023-08-04 04:54:24,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:54:24,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:54:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:54:24,139 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 04:54:24,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:54:24,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12756170] [2023-08-04 04:54:24,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12756170] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:54:24,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987457380] [2023-08-04 04:54:24,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:54:24,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:54:24,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:54:24,141 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 04:54:24,144 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 04:54:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:54:24,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 04:54:24,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:54:24,281 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 04:54:24,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:54:24,315 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 04:54:24,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987457380] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:54:24,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:54:24,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 04:54:24,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943905821] [2023-08-04 04:54:24,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:54:24,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:54:24,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:54:24,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:54:24,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:54:24,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 466 [2023-08-04 04:54:24,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 102 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 231.2) internal successors, (1156), 5 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:54:24,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:54:24,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 466 [2023-08-04 04:54:24,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:56:00,198 INFO L124 PetriNetUnfolderBase]: 1005596/1325103 cut-off events. [2023-08-04 04:56:00,198 INFO L125 PetriNetUnfolderBase]: For 458197/458213 co-relation queries the response was YES. [2023-08-04 04:56:05,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2885523 conditions, 1325103 events. 1005596/1325103 cut-off events. For 458197/458213 co-relation queries the response was YES. Maximal size of possible extension queue 31417. Compared 9958879 event pairs, 468871 based on Foata normal form. 15/970470 useless extension candidates. Maximal degree in co-relation 2885507. Up to 1224969 conditions per place. [2023-08-04 04:56:12,073 INFO L140 encePairwiseOnDemand]: 462/466 looper letters, 108 selfloop transitions, 4 changer transitions 0/139 dead transitions. [2023-08-04 04:56:12,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 139 transitions, 658 flow [2023-08-04 04:56:12,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:56:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:56:12,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1019 transitions. [2023-08-04 04:56:12,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5466738197424893 [2023-08-04 04:56:12,095 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1019 transitions. [2023-08-04 04:56:12,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1019 transitions. [2023-08-04 04:56:12,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:56:12,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1019 transitions. [2023-08-04 04:56:12,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 254.75) internal successors, (1019), 4 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:56:12,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:56:12,100 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 466.0) internal successors, (2330), 5 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:56:12,100 INFO L175 Difference]: Start difference. First operand has 97 places, 102 transitions, 304 flow. Second operand 4 states and 1019 transitions. [2023-08-04 04:56:12,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 139 transitions, 658 flow [2023-08-04 04:56:12,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 139 transitions, 643 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 04:56:12,500 INFO L231 Difference]: Finished difference. Result has 100 places, 103 transitions, 319 flow [2023-08-04 04:56:12,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=466, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=319, PETRI_PLACES=100, PETRI_TRANSITIONS=103} [2023-08-04 04:56:12,501 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 12 predicate places. [2023-08-04 04:56:12,501 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 103 transitions, 319 flow [2023-08-04 04:56:12,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 231.2) internal successors, (1156), 5 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:56:12,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:56:12,502 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:56:12,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-04 04:56:12,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:56:12,708 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err1ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-08-04 04:56:12,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:56:12,709 INFO L85 PathProgramCache]: Analyzing trace with hash 526362506, now seen corresponding path program 1 times [2023-08-04 04:56:12,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:56:12,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499771088] [2023-08-04 04:56:12,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:56:12,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:56:12,749 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-04 04:56:12,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401267640] [2023-08-04 04:56:12,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:56:12,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:56:12,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:56:12,781 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 04:56:12,833 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 04:56:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:56:12,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-04 04:56:12,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:56:12,987 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 04:56:12,987 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:56:12,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:56:12,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499771088] [2023-08-04 04:56:12,988 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-04 04:56:12,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401267640] [2023-08-04 04:56:12,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401267640] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:56:12,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:56:12,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 04:56:12,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590058509] [2023-08-04 04:56:12,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:56:12,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:56:12,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:56:12,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:56:12,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:56:13,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 466 [2023-08-04 04:56:13,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 103 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 224.2) internal successors, (1121), 5 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:56:13,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:56:13,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 466 [2023-08-04 04:56:13,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-08-04 04:56:34,537 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 04:56:34,537 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 04:56:35,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 04:56:35,270 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2023-08-04 04:56:35,277 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 04:56:35,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:56:35,646 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 222/466 universal loopers) in iteration 6,while PetriNetUnfolder was constructing finite prefix that currently has 720961 conditions, 341841 events (256188/341840 cut-off events. For 82322/82322 co-relation queries the response was YES. Maximal size of possible extension queue 22876. Compared 2598894 event pairs, 140177 based on Foata normal form. 0/269022 useless extension candidates. Maximal degree in co-relation 720942. Up to 205212 conditions per place.). [2023-08-04 04:56:35,647 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2023-08-04 04:56:35,647 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2023-08-04 04:56:35,647 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2023-08-04 04:56:35,647 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2023-08-04 04:56:35,647 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 9 remaining) [2023-08-04 04:56:35,647 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2023-08-04 04:56:35,647 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2023-08-04 04:56:35,647 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2023-08-04 04:56:35,647 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-04 04:56:35,648 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-04 04:56:35,648 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 04:56:35,648 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 04:56:35,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 04:56:35 BasicIcfg [2023-08-04 04:56:35,652 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 04:56:35,652 INFO L158 Benchmark]: Toolchain (without parser) took 536872.47ms. Allocated memory was 595.6MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 543.9MB in the beginning and 13.7GB in the end (delta: -13.1GB). Peak memory consumption was 9.7GB. Max. memory is 16.0GB. [2023-08-04 04:56:35,652 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 358.6MB. Free memory is still 308.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 04:56:35,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.55ms. Allocated memory is still 595.6MB. Free memory was 543.8MB in the beginning and 523.0MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-04 04:56:35,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.86ms. Allocated memory is still 595.6MB. Free memory was 523.0MB in the beginning and 520.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-04 04:56:35,653 INFO L158 Benchmark]: Boogie Preprocessor took 32.61ms. Allocated memory is still 595.6MB. Free memory was 520.4MB in the beginning and 518.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 04:56:35,653 INFO L158 Benchmark]: RCFGBuilder took 575.05ms. Allocated memory is still 595.6MB. Free memory was 518.3MB in the beginning and 559.0MB in the end (delta: -40.6MB). Peak memory consumption was 24.9MB. Max. memory is 16.0GB. [2023-08-04 04:56:35,653 INFO L158 Benchmark]: TraceAbstraction took 535746.71ms. Allocated memory was 595.6MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 559.0MB in the beginning and 13.7GB in the end (delta: -13.1GB). Peak memory consumption was 9.7GB. Max. memory is 16.0GB. [2023-08-04 04:56:35,654 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 358.6MB. Free memory is still 308.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 445.55ms. Allocated memory is still 595.6MB. Free memory was 543.8MB in the beginning and 523.0MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.86ms. Allocated memory is still 595.6MB. Free memory was 523.0MB in the beginning and 520.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.61ms. Allocated memory is still 595.6MB. Free memory was 520.4MB in the beginning and 518.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 575.05ms. Allocated memory is still 595.6MB. Free memory was 518.3MB in the beginning and 559.0MB in the end (delta: -40.6MB). Peak memory consumption was 24.9MB. Max. memory is 16.0GB. * TraceAbstraction took 535746.71ms. Allocated memory was 595.6MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 559.0MB in the beginning and 13.7GB in the end (delta: -13.1GB). Peak memory consumption was 9.7GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 208]: Unsoundness Warning unspecified type, defaulting to int C: short [208] - GenericResultAtLocation [Line: 209]: Unsoundness Warning unspecified type, defaulting to int C: short [209] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 164 PlacesBefore, 48 PlacesAfterwards, 178 TransitionsBefore, 54 TransitionsAfterwards, 10790 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 21 ConcurrentYvCompositions, 8 ChoiceCompositions, 147 TotalNumberOfCompositions, 22736 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15171, independent: 14825, independent conditional: 0, independent unconditional: 14825, dependent: 346, dependent conditional: 0, dependent unconditional: 346, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5885, independent: 5830, independent conditional: 0, independent unconditional: 5830, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15171, independent: 8995, independent conditional: 0, independent unconditional: 8995, dependent: 291, dependent conditional: 0, dependent unconditional: 291, unknown: 5885, unknown conditional: 0, unknown unconditional: 5885] , Statistics on independence cache: Total cache size (in pairs): 448, Positive cache size: 426, Positive conditional cache size: 0, Positive unconditional cache size: 426, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 164 PlacesBefore, 48 PlacesAfterwards, 178 TransitionsBefore, 54 TransitionsAfterwards, 10790 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 21 ConcurrentYvCompositions, 8 ChoiceCompositions, 146 TotalNumberOfCompositions, 22938 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15080, independent: 14726, independent conditional: 0, independent unconditional: 14726, dependent: 354, dependent conditional: 0, dependent unconditional: 354, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5897, independent: 5846, independent conditional: 0, independent unconditional: 5846, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15080, independent: 8880, independent conditional: 0, independent unconditional: 8880, dependent: 303, dependent conditional: 0, dependent unconditional: 303, unknown: 5897, unknown conditional: 0, unknown unconditional: 5897] , Statistics on independence cache: Total cache size (in pairs): 484, Positive cache size: 462, Positive conditional cache size: 0, Positive unconditional cache size: 462, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 240 PlacesBefore, 88 PlacesAfterwards, 265 TransitionsBefore, 102 TransitionsAfterwards, 36332 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 116 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 11 ChoiceCompositions, 201 TotalNumberOfCompositions, 112672 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 51964, independent: 51118, independent conditional: 0, independent unconditional: 51118, dependent: 846, dependent conditional: 0, dependent unconditional: 846, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 18410, independent: 18305, independent conditional: 0, independent unconditional: 18305, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 51964, independent: 32813, independent conditional: 0, independent unconditional: 32813, dependent: 741, dependent conditional: 0, dependent unconditional: 741, unknown: 18410, unknown conditional: 0, unknown unconditional: 18410] , Statistics on independence cache: Total cache size (in pairs): 1876, Positive cache size: 1825, Positive conditional cache size: 0, Positive unconditional cache size: 1825, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 731]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 222/466 universal loopers) in iteration 6,while PetriNetUnfolder was constructing finite prefix that currently has 720961 conditions, 341841 events (256188/341840 cut-off events. For 82322/82322 co-relation queries the response was YES. Maximal size of possible extension queue 22876. Compared 2598894 event pairs, 140177 based on Foata normal form. 0/269022 useless extension candidates. Maximal degree in co-relation 720942. Up to 205212 conditions per place.). - TimeoutResultAtElement [Line: 714]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 222/466 universal loopers) in iteration 6,while PetriNetUnfolder was constructing finite prefix that currently has 720961 conditions, 341841 events (256188/341840 cut-off events. For 82322/82322 co-relation queries the response was YES. Maximal size of possible extension queue 22876. Compared 2598894 event pairs, 140177 based on Foata normal form. 0/269022 useless extension candidates. Maximal degree in co-relation 720942. Up to 205212 conditions per place.). - TimeoutResultAtElement [Line: 749]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 222/466 universal loopers) in iteration 6,while PetriNetUnfolder was constructing finite prefix that currently has 720961 conditions, 341841 events (256188/341840 cut-off events. For 82322/82322 co-relation queries the response was YES. Maximal size of possible extension queue 22876. Compared 2598894 event pairs, 140177 based on Foata normal form. 0/269022 useless extension candidates. Maximal degree in co-relation 720942. Up to 205212 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 232 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.4s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 668 IncrementalHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 15 mSDtfsCounter, 668 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=3, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 204 SizeOfPredicates, 3 NumberOfNonLiveVariables, 547 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 3/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 304 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 523.0s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 515.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 781 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 663 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2001 IncrementalHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 23 mSDtfsCounter, 2001 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=319occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 84 ConstructedInterpolants, 1 QuantifiedInterpolants, 216 SizeOfPredicates, 6 NumberOfNonLiveVariables, 702 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 2/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 232 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.2s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown